./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers/cdaudio_true-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers/cdaudio_true-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/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 160eb16351cf5e45422f0c48798411822921f18c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 01:57:37,977 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:57:37,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:57:37,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:57:37,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:57:37,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:57:37,989 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:57:37,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:57:37,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:57:37,992 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:57:37,993 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:57:37,993 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:57:37,994 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:57:37,994 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:57:37,996 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:57:37,996 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:57:37,997 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:57:37,998 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:57:38,000 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:57:38,001 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:57:38,002 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:57:38,003 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:57:38,005 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:57:38,005 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:57:38,005 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:57:38,006 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:57:38,007 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:57:38,007 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:57:38,008 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:57:38,009 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:57:38,009 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:57:38,009 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:57:38,010 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:57:38,010 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:57:38,011 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:57:38,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:57:38,012 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 01:57:38,023 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:57:38,023 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:57:38,024 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:57:38,024 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:57:38,024 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:57:38,024 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:57:38,025 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 01:57:38,025 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:57:38,025 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:57:38,025 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:57:38,025 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:57:38,025 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:57:38,025 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:57:38,026 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:57:38,026 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:57:38,026 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:57:38,026 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:57:38,026 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:57:38,026 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:57:38,026 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:57:38,027 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:57:38,027 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:57:38,028 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:57:38,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:57:38,029 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:57:38,029 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:57:38,029 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:57:38,029 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 01:57:38,029 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:57:38,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:57:38,029 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_2f0ee409-1735-4738-9976-ae0a2bec1587/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 -> 160eb16351cf5e45422f0c48798411822921f18c [2018-11-23 01:57:38,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:57:38,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:57:38,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:57:38,062 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:57:38,062 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:57:38,062 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers/cdaudio_true-unreach-call.i.cil.c [2018-11-23 01:57:38,098 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/data/97d096f71/870b91913f91421ba5767fe36fb3acd5/FLAG258abc5d5 [2018-11-23 01:57:38,609 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:57:38,609 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/sv-benchmarks/c/ntdrivers/cdaudio_true-unreach-call.i.cil.c [2018-11-23 01:57:38,633 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/data/97d096f71/870b91913f91421ba5767fe36fb3acd5/FLAG258abc5d5 [2018-11-23 01:57:38,857 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/data/97d096f71/870b91913f91421ba5767fe36fb3acd5 [2018-11-23 01:57:38,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:57:38,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:57:38,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:57:38,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:57:38,863 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:57:38,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:57:38" (1/1) ... [2018-11-23 01:57:38,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223c089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:38, skipping insertion in model container [2018-11-23 01:57:38,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:57:38" (1/1) ... [2018-11-23 01:57:38,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:57:38,961 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:57:40,084 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:57:40,091 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:57:40,378 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:57:40,427 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:57:40,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40 WrapperNode [2018-11-23 01:57:40,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:57:40,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:57:40,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:57:40,428 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:57:40,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (1/1) ... [2018-11-23 01:57:40,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (1/1) ... [2018-11-23 01:57:40,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:57:40,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:57:40,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:57:40,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:57:40,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (1/1) ... [2018-11-23 01:57:40,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (1/1) ... [2018-11-23 01:57:40,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (1/1) ... [2018-11-23 01:57:40,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (1/1) ... [2018-11-23 01:57:40,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (1/1) ... [2018-11-23 01:57:40,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (1/1) ... [2018-11-23 01:57:40,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (1/1) ... [2018-11-23 01:57:40,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:57:40,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:57:40,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:57:40,688 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:57:40,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/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-23 01:57:40,729 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-23 01:57:40,730 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-23 01:57:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-23 01:57:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:57:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2018-11-23 01:57:40,730 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2018-11-23 01:57:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:57:40,730 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-23 01:57:40,731 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-23 01:57:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure MmLockPagableDataSection [2018-11-23 01:57:40,731 INFO L138 BoogieDeclarations]: Found implementation of procedure MmLockPagableDataSection [2018-11-23 01:57:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2018-11-23 01:57:40,731 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2018-11-23 01:57:40,731 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2018-11-23 01:57:40,731 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2018-11-23 01:57:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2018-11-23 01:57:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2018-11-23 01:57:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:57:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2018-11-23 01:57:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2018-11-23 01:57:40,732 INFO L130 BoogieDeclarations]: Found specification of procedure IoOpenDeviceRegistryKey [2018-11-23 01:57:40,732 INFO L138 BoogieDeclarations]: Found implementation of procedure IoOpenDeviceRegistryKey [2018-11-23 01:57:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2018-11-23 01:57:40,733 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2018-11-23 01:57:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-23 01:57:40,733 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-23 01:57:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-23 01:57:40,733 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-23 01:57:40,733 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2018-11-23 01:57:40,733 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2018-11-23 01:57:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_malloc [2018-11-23 01:57:40,734 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_malloc [2018-11-23 01:57:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-23 01:57:40,734 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-23 01:57:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure RtlWriteRegistryValue [2018-11-23 01:57:40,734 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlWriteRegistryValue [2018-11-23 01:57:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:57:40,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:57:40,734 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-23 01:57:40,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-23 01:57:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2018-11-23 01:57:40,735 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2018-11-23 01:57:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:57:40,735 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:57:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 01:57:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-23 01:57:40,735 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-23 01:57:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2018-11-23 01:57:40,735 INFO L130 BoogieDeclarations]: Found specification of procedure NecSupportNeeded [2018-11-23 01:57:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure NecSupportNeeded [2018-11-23 01:57:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 01:57:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-23 01:57:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-23 01:57:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-23 01:57:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-23 01:57:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2018-11-23 01:57:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2018-11-23 01:57:40,736 INFO L130 BoogieDeclarations]: Found specification of procedure RtlCompareMemory [2018-11-23 01:57:40,736 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlCompareMemory [2018-11-23 01:57:40,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:57:40,737 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-23 01:57:40,737 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-23 01:57:40,737 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2018-11-23 01:57:40,737 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2018-11-23 01:57:40,737 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-23 01:57:40,737 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-23 01:57:40,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-23 01:57:40,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-23 01:57:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2018-11-23 01:57:40,738 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2018-11-23 01:57:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2018-11-23 01:57:40,738 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2018-11-23 01:57:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2018-11-23 01:57:40,738 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2018-11-23 01:57:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 01:57:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2018-11-23 01:57:40,738 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2018-11-23 01:57:40,739 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2018-11-23 01:57:40,739 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2018-11-23 01:57:40,739 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-11-23 01:57:40,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-11-23 01:57:40,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:57:40,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:57:40,739 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2018-11-23 01:57:40,739 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2018-11-23 01:57:40,739 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2018-11-23 01:57:40,739 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2018-11-23 01:57:41,608 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:57:41,608 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:57:41,678 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:57:41,679 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:57:41,751 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:57:41,751 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:57:48,666 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:57:48,667 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:57:50,759 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:57:50,760 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:58:00,275 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:58:00,275 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:58:01,371 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:58:01,371 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:58:01,395 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:58:01,395 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:58:15,434 WARN L640 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-23 01:58:15,434 WARN L605 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-23 01:58:15,457 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:58:15,457 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 01:58:15,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:15 BoogieIcfgContainer [2018-11-23 01:58:15,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:58:15,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:58:15,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:58:15,462 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:58:15,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:57:38" (1/3) ... [2018-11-23 01:58:15,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f78819e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:58:15, skipping insertion in model container [2018-11-23 01:58:15,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:57:40" (2/3) ... [2018-11-23 01:58:15,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f78819e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:58:15, skipping insertion in model container [2018-11-23 01:58:15,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:15" (3/3) ... [2018-11-23 01:58:15,466 INFO L112 eAbstractionObserver]: Analyzing ICFG cdaudio_true-unreach-call.i.cil.c [2018-11-23 01:58:15,475 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:58:15,485 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:58:15,500 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:58:15,532 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:58:15,533 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:58:15,533 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:58:15,533 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:58:15,533 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:58:15,533 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:58:15,533 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:58:15,533 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:58:15,533 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:58:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states. [2018-11-23 01:58:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 01:58:15,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:15,560 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] [2018-11-23 01:58:15,562 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:15,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1743114210, now seen corresponding path program 1 times [2018-11-23 01:58:15,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:15,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:15,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:15,833 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-23 01:58:15,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:15,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:15,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:15,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:15,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:15,852 INFO L87 Difference]: Start difference. First operand 670 states. Second operand 3 states. [2018-11-23 01:58:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:16,020 INFO L93 Difference]: Finished difference Result 1184 states and 1810 transitions. [2018-11-23 01:58:16,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:16,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 01:58:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:16,034 INFO L225 Difference]: With dead ends: 1184 [2018-11-23 01:58:16,034 INFO L226 Difference]: Without dead ends: 662 [2018-11-23 01:58:16,038 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-23 01:58:16,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2018-11-23 01:58:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2018-11-23 01:58:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-11-23 01:58:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 968 transitions. [2018-11-23 01:58:16,104 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 968 transitions. Word has length 20 [2018-11-23 01:58:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:16,104 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 968 transitions. [2018-11-23 01:58:16,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 968 transitions. [2018-11-23 01:58:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 01:58:16,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:16,105 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] [2018-11-23 01:58:16,106 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:16,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -173093313, now seen corresponding path program 1 times [2018-11-23 01:58:16,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:16,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:16,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:16,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:16,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:16,220 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-23 01:58:16,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:16,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:16,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:16,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:16,224 INFO L87 Difference]: Start difference. First operand 662 states and 968 transitions. Second operand 3 states. [2018-11-23 01:58:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:16,422 INFO L93 Difference]: Finished difference Result 1247 states and 1801 transitions. [2018-11-23 01:58:16,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:16,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 01:58:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:16,430 INFO L225 Difference]: With dead ends: 1247 [2018-11-23 01:58:16,430 INFO L226 Difference]: Without dead ends: 977 [2018-11-23 01:58:16,432 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-23 01:58:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-11-23 01:58:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 957. [2018-11-23 01:58:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2018-11-23 01:58:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1386 transitions. [2018-11-23 01:58:16,474 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1386 transitions. Word has length 25 [2018-11-23 01:58:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:16,474 INFO L480 AbstractCegarLoop]: Abstraction has 957 states and 1386 transitions. [2018-11-23 01:58:16,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1386 transitions. [2018-11-23 01:58:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 01:58:16,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:16,476 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] [2018-11-23 01:58:16,476 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:16,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:16,477 INFO L82 PathProgramCache]: Analyzing trace with hash 985233087, now seen corresponding path program 1 times [2018-11-23 01:58:16,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:16,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:16,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:16,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:16,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:16,556 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-23 01:58:16,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:16,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:16,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:16,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:16,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:16,557 INFO L87 Difference]: Start difference. First operand 957 states and 1386 transitions. Second operand 3 states. [2018-11-23 01:58:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:16,742 INFO L93 Difference]: Finished difference Result 2002 states and 2977 transitions. [2018-11-23 01:58:16,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:16,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 01:58:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:16,749 INFO L225 Difference]: With dead ends: 2002 [2018-11-23 01:58:16,749 INFO L226 Difference]: Without dead ends: 1570 [2018-11-23 01:58:16,750 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-23 01:58:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2018-11-23 01:58:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1127. [2018-11-23 01:58:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2018-11-23 01:58:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1659 transitions. [2018-11-23 01:58:16,796 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1659 transitions. Word has length 32 [2018-11-23 01:58:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:16,796 INFO L480 AbstractCegarLoop]: Abstraction has 1127 states and 1659 transitions. [2018-11-23 01:58:16,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:16,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1659 transitions. [2018-11-23 01:58:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 01:58:16,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:16,798 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] [2018-11-23 01:58:16,798 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:16,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:16,799 INFO L82 PathProgramCache]: Analyzing trace with hash 238943091, now seen corresponding path program 1 times [2018-11-23 01:58:16,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:16,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:16,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:16,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:16,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:16,990 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-23 01:58:16,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:16,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:58:16,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:58:16,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:58:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:58:16,991 INFO L87 Difference]: Start difference. First operand 1127 states and 1659 transitions. Second operand 5 states. [2018-11-23 01:58:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:17,908 INFO L93 Difference]: Finished difference Result 1830 states and 2712 transitions. [2018-11-23 01:58:17,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:58:17,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 01:58:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:17,912 INFO L225 Difference]: With dead ends: 1830 [2018-11-23 01:58:17,912 INFO L226 Difference]: Without dead ends: 1143 [2018-11-23 01:58:17,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:58:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-11-23 01:58:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1121. [2018-11-23 01:58:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2018-11-23 01:58:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1647 transitions. [2018-11-23 01:58:17,947 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1647 transitions. Word has length 33 [2018-11-23 01:58:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:17,947 INFO L480 AbstractCegarLoop]: Abstraction has 1121 states and 1647 transitions. [2018-11-23 01:58:17,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:58:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1647 transitions. [2018-11-23 01:58:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 01:58:17,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:17,948 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] [2018-11-23 01:58:17,949 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:17,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1356117568, now seen corresponding path program 1 times [2018-11-23 01:58:17,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:17,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:17,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:18,016 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-23 01:58:18,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:18,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:18,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:18,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:18,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:18,017 INFO L87 Difference]: Start difference. First operand 1121 states and 1647 transitions. Second operand 3 states. [2018-11-23 01:58:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:18,071 INFO L93 Difference]: Finished difference Result 1855 states and 2667 transitions. [2018-11-23 01:58:18,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:18,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 01:58:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:18,076 INFO L225 Difference]: With dead ends: 1855 [2018-11-23 01:58:18,076 INFO L226 Difference]: Without dead ends: 1686 [2018-11-23 01:58:18,078 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-23 01:58:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2018-11-23 01:58:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1598. [2018-11-23 01:58:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1598 states. [2018-11-23 01:58:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2339 transitions. [2018-11-23 01:58:18,129 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2339 transitions. Word has length 34 [2018-11-23 01:58:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:18,129 INFO L480 AbstractCegarLoop]: Abstraction has 1598 states and 2339 transitions. [2018-11-23 01:58:18,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2339 transitions. [2018-11-23 01:58:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 01:58:18,131 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:18,131 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] [2018-11-23 01:58:18,131 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:18,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:18,131 INFO L82 PathProgramCache]: Analyzing trace with hash -340286485, now seen corresponding path program 1 times [2018-11-23 01:58:18,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:18,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:18,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:18,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:18,242 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-23 01:58:18,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:18,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:58:18,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:58:18,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:58:18,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:58:18,243 INFO L87 Difference]: Start difference. First operand 1598 states and 2339 transitions. Second operand 4 states. [2018-11-23 01:58:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:18,712 INFO L93 Difference]: Finished difference Result 1601 states and 2341 transitions. [2018-11-23 01:58:18,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:58:18,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 01:58:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:18,717 INFO L225 Difference]: With dead ends: 1601 [2018-11-23 01:58:18,717 INFO L226 Difference]: Without dead ends: 1597 [2018-11-23 01:58:18,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:58:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2018-11-23 01:58:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1597. [2018-11-23 01:58:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1597 states. [2018-11-23 01:58:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1597 states to 1597 states and 2336 transitions. [2018-11-23 01:58:18,764 INFO L78 Accepts]: Start accepts. Automaton has 1597 states and 2336 transitions. Word has length 34 [2018-11-23 01:58:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:18,764 INFO L480 AbstractCegarLoop]: Abstraction has 1597 states and 2336 transitions. [2018-11-23 01:58:18,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:58:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1597 states and 2336 transitions. [2018-11-23 01:58:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 01:58:18,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:18,766 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] [2018-11-23 01:58:18,766 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:18,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1852040988, now seen corresponding path program 1 times [2018-11-23 01:58:18,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:18,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:18,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:18,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:18,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:18,872 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-23 01:58:18,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:18,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:58:18,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:58:18,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:58:18,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:58:18,873 INFO L87 Difference]: Start difference. First operand 1597 states and 2336 transitions. Second operand 4 states. [2018-11-23 01:58:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:19,094 INFO L93 Difference]: Finished difference Result 2395 states and 3441 transitions. [2018-11-23 01:58:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:58:19,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-23 01:58:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:19,098 INFO L225 Difference]: With dead ends: 2395 [2018-11-23 01:58:19,098 INFO L226 Difference]: Without dead ends: 1279 [2018-11-23 01:58:19,100 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-23 01:58:19,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-11-23 01:58:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1186. [2018-11-23 01:58:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-11-23 01:58:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1710 transitions. [2018-11-23 01:58:19,133 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1710 transitions. Word has length 45 [2018-11-23 01:58:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:19,134 INFO L480 AbstractCegarLoop]: Abstraction has 1186 states and 1710 transitions. [2018-11-23 01:58:19,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:58:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1710 transitions. [2018-11-23 01:58:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 01:58:19,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:19,135 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] [2018-11-23 01:58:19,136 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:19,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:19,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1257221939, now seen corresponding path program 1 times [2018-11-23 01:58:19,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:19,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:19,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:19,253 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-23 01:58:19,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:19,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:19,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:19,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:19,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:19,254 INFO L87 Difference]: Start difference. First operand 1186 states and 1710 transitions. Second operand 3 states. [2018-11-23 01:58:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:19,284 INFO L93 Difference]: Finished difference Result 1864 states and 2670 transitions. [2018-11-23 01:58:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:19,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-11-23 01:58:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:19,288 INFO L225 Difference]: With dead ends: 1864 [2018-11-23 01:58:19,288 INFO L226 Difference]: Without dead ends: 1183 [2018-11-23 01:58:19,289 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-23 01:58:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-11-23 01:58:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2018-11-23 01:58:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-11-23 01:58:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1699 transitions. [2018-11-23 01:58:19,324 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1699 transitions. Word has length 46 [2018-11-23 01:58:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:19,324 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1699 transitions. [2018-11-23 01:58:19,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1699 transitions. [2018-11-23 01:58:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 01:58:19,326 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:19,326 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] [2018-11-23 01:58:19,326 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:19,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:19,327 INFO L82 PathProgramCache]: Analyzing trace with hash -54134173, now seen corresponding path program 1 times [2018-11-23 01:58:19,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:19,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:19,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:19,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:19,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:19,491 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-23 01:58:19,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:19,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:58:19,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:58:19,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:58:19,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:58:19,492 INFO L87 Difference]: Start difference. First operand 1183 states and 1699 transitions. Second operand 7 states. [2018-11-23 01:58:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:22,135 INFO L93 Difference]: Finished difference Result 1696 states and 2455 transitions. [2018-11-23 01:58:22,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 01:58:22,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-23 01:58:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:22,141 INFO L225 Difference]: With dead ends: 1696 [2018-11-23 01:58:22,141 INFO L226 Difference]: Without dead ends: 1635 [2018-11-23 01:58:22,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:58:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2018-11-23 01:58:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1214. [2018-11-23 01:58:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-11-23 01:58:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1744 transitions. [2018-11-23 01:58:22,186 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1744 transitions. Word has length 47 [2018-11-23 01:58:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:22,186 INFO L480 AbstractCegarLoop]: Abstraction has 1214 states and 1744 transitions. [2018-11-23 01:58:22,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:58:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1744 transitions. [2018-11-23 01:58:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 01:58:22,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:22,188 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-23 01:58:22,188 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:22,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:22,188 INFO L82 PathProgramCache]: Analyzing trace with hash -38144587, now seen corresponding path program 1 times [2018-11-23 01:58:22,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:22,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:22,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:22,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:22,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-23 01:58:22,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:22,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:22,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:22,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:22,275 INFO L87 Difference]: Start difference. First operand 1214 states and 1744 transitions. Second operand 3 states. [2018-11-23 01:58:22,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:22,329 INFO L93 Difference]: Finished difference Result 1904 states and 2710 transitions. [2018-11-23 01:58:22,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:22,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-11-23 01:58:22,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:22,333 INFO L225 Difference]: With dead ends: 1904 [2018-11-23 01:58:22,333 INFO L226 Difference]: Without dead ends: 1285 [2018-11-23 01:58:22,334 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-23 01:58:22,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2018-11-23 01:58:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1214. [2018-11-23 01:58:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-11-23 01:58:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1743 transitions. [2018-11-23 01:58:22,372 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1743 transitions. Word has length 53 [2018-11-23 01:58:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:22,372 INFO L480 AbstractCegarLoop]: Abstraction has 1214 states and 1743 transitions. [2018-11-23 01:58:22,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1743 transitions. [2018-11-23 01:58:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 01:58:22,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:22,374 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-23 01:58:22,374 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:22,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash 474643870, now seen corresponding path program 1 times [2018-11-23 01:58:22,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:22,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:22,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:22,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:22,424 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-23 01:58:22,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:22,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:22,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:22,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:22,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:22,425 INFO L87 Difference]: Start difference. First operand 1214 states and 1743 transitions. Second operand 3 states. [2018-11-23 01:58:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:22,462 INFO L93 Difference]: Finished difference Result 1252 states and 1790 transitions. [2018-11-23 01:58:22,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:22,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-23 01:58:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:22,465 INFO L225 Difference]: With dead ends: 1252 [2018-11-23 01:58:22,466 INFO L226 Difference]: Without dead ends: 1224 [2018-11-23 01:58:22,466 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-23 01:58:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2018-11-23 01:58:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1217. [2018-11-23 01:58:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2018-11-23 01:58:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1747 transitions. [2018-11-23 01:58:22,556 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1747 transitions. Word has length 49 [2018-11-23 01:58:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:22,556 INFO L480 AbstractCegarLoop]: Abstraction has 1217 states and 1747 transitions. [2018-11-23 01:58:22,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:22,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1747 transitions. [2018-11-23 01:58:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 01:58:22,558 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:22,558 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-23 01:58:22,559 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:22,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:22,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1519500836, now seen corresponding path program 1 times [2018-11-23 01:58:22,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:22,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:22,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:22,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:22,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:22,659 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-23 01:58:22,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:22,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:58:22,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:58:22,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:58:22,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:58:22,660 INFO L87 Difference]: Start difference. First operand 1217 states and 1747 transitions. Second operand 5 states. [2018-11-23 01:58:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:23,764 INFO L93 Difference]: Finished difference Result 1255 states and 1792 transitions. [2018-11-23 01:58:23,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:58:23,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-11-23 01:58:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:23,769 INFO L225 Difference]: With dead ends: 1255 [2018-11-23 01:58:23,770 INFO L226 Difference]: Without dead ends: 1245 [2018-11-23 01:58:23,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-23 01:58:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2018-11-23 01:58:23,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1222. [2018-11-23 01:58:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-11-23 01:58:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1753 transitions. [2018-11-23 01:58:23,832 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1753 transitions. Word has length 49 [2018-11-23 01:58:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:23,832 INFO L480 AbstractCegarLoop]: Abstraction has 1222 states and 1753 transitions. [2018-11-23 01:58:23,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:58:23,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1753 transitions. [2018-11-23 01:58:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 01:58:23,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:23,834 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-23 01:58:23,834 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:23,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:23,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1533845745, now seen corresponding path program 1 times [2018-11-23 01:58:23,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:23,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:23,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:23,958 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-23 01:58:23,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:23,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:58:23,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:58:23,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:58:23,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:58:23,959 INFO L87 Difference]: Start difference. First operand 1222 states and 1753 transitions. Second operand 7 states. [2018-11-23 01:58:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:25,901 INFO L93 Difference]: Finished difference Result 1424 states and 2058 transitions. [2018-11-23 01:58:25,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:58:25,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-23 01:58:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:25,906 INFO L225 Difference]: With dead ends: 1424 [2018-11-23 01:58:25,907 INFO L226 Difference]: Without dead ends: 1313 [2018-11-23 01:58:25,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-23 01:58:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2018-11-23 01:58:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1184. [2018-11-23 01:58:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2018-11-23 01:58:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1703 transitions. [2018-11-23 01:58:25,975 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1703 transitions. Word has length 49 [2018-11-23 01:58:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:25,976 INFO L480 AbstractCegarLoop]: Abstraction has 1184 states and 1703 transitions. [2018-11-23 01:58:25,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:58:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1703 transitions. [2018-11-23 01:58:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 01:58:25,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:25,977 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-23 01:58:25,978 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:25,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:25,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1372808034, now seen corresponding path program 1 times [2018-11-23 01:58:25,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:25,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:25,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:25,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:25,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:26,049 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-23 01:58:26,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:26,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:26,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:26,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:26,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:26,050 INFO L87 Difference]: Start difference. First operand 1184 states and 1703 transitions. Second operand 3 states. [2018-11-23 01:58:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:26,139 INFO L93 Difference]: Finished difference Result 1202 states and 1726 transitions. [2018-11-23 01:58:26,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:26,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-23 01:58:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:26,144 INFO L225 Difference]: With dead ends: 1202 [2018-11-23 01:58:26,144 INFO L226 Difference]: Without dead ends: 1179 [2018-11-23 01:58:26,145 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-23 01:58:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-11-23 01:58:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1179. [2018-11-23 01:58:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2018-11-23 01:58:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1694 transitions. [2018-11-23 01:58:26,206 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1694 transitions. Word has length 49 [2018-11-23 01:58:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:26,207 INFO L480 AbstractCegarLoop]: Abstraction has 1179 states and 1694 transitions. [2018-11-23 01:58:26,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1694 transitions. [2018-11-23 01:58:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 01:58:26,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:26,208 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-23 01:58:26,209 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:26,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1387152943, now seen corresponding path program 1 times [2018-11-23 01:58:26,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:26,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:26,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:26,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:26,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:58:26,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:26,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:26,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:26,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:26,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:26,276 INFO L87 Difference]: Start difference. First operand 1179 states and 1694 transitions. Second operand 3 states. [2018-11-23 01:58:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:26,476 INFO L93 Difference]: Finished difference Result 1494 states and 2137 transitions. [2018-11-23 01:58:26,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:26,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-23 01:58:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:26,480 INFO L225 Difference]: With dead ends: 1494 [2018-11-23 01:58:26,480 INFO L226 Difference]: Without dead ends: 1483 [2018-11-23 01:58:26,481 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-23 01:58:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2018-11-23 01:58:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1208. [2018-11-23 01:58:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-11-23 01:58:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1724 transitions. [2018-11-23 01:58:26,523 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1724 transitions. Word has length 49 [2018-11-23 01:58:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:26,524 INFO L480 AbstractCegarLoop]: Abstraction has 1208 states and 1724 transitions. [2018-11-23 01:58:26,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1724 transitions. [2018-11-23 01:58:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 01:58:26,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:26,525 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-23 01:58:26,526 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:26,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash 400263377, now seen corresponding path program 1 times [2018-11-23 01:58:26,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:26,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:26,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:26,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:26,602 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-23 01:58:26,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:26,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 01:58:26,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:58:26,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:58:26,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:58:26,603 INFO L87 Difference]: Start difference. First operand 1208 states and 1724 transitions. Second operand 8 states. [2018-11-23 01:58:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:26,786 INFO L93 Difference]: Finished difference Result 1222 states and 1739 transitions. [2018-11-23 01:58:26,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:58:26,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-23 01:58:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:26,789 INFO L225 Difference]: With dead ends: 1222 [2018-11-23 01:58:26,789 INFO L226 Difference]: Without dead ends: 1218 [2018-11-23 01:58:26,790 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-23 01:58:26,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2018-11-23 01:58:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1216. [2018-11-23 01:58:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-23 01:58:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1733 transitions. [2018-11-23 01:58:26,830 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1733 transitions. Word has length 50 [2018-11-23 01:58:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:26,830 INFO L480 AbstractCegarLoop]: Abstraction has 1216 states and 1733 transitions. [2018-11-23 01:58:26,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:58:26,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1733 transitions. [2018-11-23 01:58:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 01:58:26,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:26,832 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-23 01:58:26,832 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:26,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash 399986547, now seen corresponding path program 1 times [2018-11-23 01:58:26,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:26,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:26,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:26,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:26,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:26,920 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-23 01:58:26,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:26,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:58:26,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:58:26,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:58:26,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:58:26,921 INFO L87 Difference]: Start difference. First operand 1216 states and 1733 transitions. Second operand 5 states. [2018-11-23 01:58:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:27,563 INFO L93 Difference]: Finished difference Result 1493 states and 2133 transitions. [2018-11-23 01:58:27,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:58:27,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-23 01:58:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:27,566 INFO L225 Difference]: With dead ends: 1493 [2018-11-23 01:58:27,566 INFO L226 Difference]: Without dead ends: 1458 [2018-11-23 01:58:27,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:58:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-11-23 01:58:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1187. [2018-11-23 01:58:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2018-11-23 01:58:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1700 transitions. [2018-11-23 01:58:27,610 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1700 transitions. Word has length 50 [2018-11-23 01:58:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:27,611 INFO L480 AbstractCegarLoop]: Abstraction has 1187 states and 1700 transitions. [2018-11-23 01:58:27,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:58:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1700 transitions. [2018-11-23 01:58:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 01:58:27,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:27,612 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-23 01:58:27,613 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:27,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash 324023454, now seen corresponding path program 1 times [2018-11-23 01:58:27,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:27,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:27,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:27,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:27,685 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-23 01:58:27,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:27,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:27,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:27,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:27,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:27,686 INFO L87 Difference]: Start difference. First operand 1187 states and 1700 transitions. Second operand 3 states. [2018-11-23 01:58:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:27,731 INFO L93 Difference]: Finished difference Result 1294 states and 1826 transitions. [2018-11-23 01:58:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:27,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-23 01:58:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:27,735 INFO L225 Difference]: With dead ends: 1294 [2018-11-23 01:58:27,735 INFO L226 Difference]: Without dead ends: 1196 [2018-11-23 01:58:27,736 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-23 01:58:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-11-23 01:58:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1176. [2018-11-23 01:58:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-23 01:58:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1687 transitions. [2018-11-23 01:58:27,777 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1687 transitions. Word has length 54 [2018-11-23 01:58:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:27,778 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1687 transitions. [2018-11-23 01:58:27,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:27,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1687 transitions. [2018-11-23 01:58:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 01:58:27,779 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:27,779 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-23 01:58:27,780 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:27,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:27,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1679053652, now seen corresponding path program 1 times [2018-11-23 01:58:27,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:27,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:27,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:27,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:27,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:27,844 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-23 01:58:27,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:27,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:27,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:27,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:27,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:27,845 INFO L87 Difference]: Start difference. First operand 1176 states and 1687 transitions. Second operand 3 states. [2018-11-23 01:58:28,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:28,996 INFO L93 Difference]: Finished difference Result 1215 states and 1732 transitions. [2018-11-23 01:58:28,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:28,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-23 01:58:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:29,000 INFO L225 Difference]: With dead ends: 1215 [2018-11-23 01:58:29,000 INFO L226 Difference]: Without dead ends: 1182 [2018-11-23 01:58:29,001 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-23 01:58:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-11-23 01:58:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1177. [2018-11-23 01:58:29,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-23 01:58:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1688 transitions. [2018-11-23 01:58:29,074 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1688 transitions. Word has length 58 [2018-11-23 01:58:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:29,074 INFO L480 AbstractCegarLoop]: Abstraction has 1177 states and 1688 transitions. [2018-11-23 01:58:29,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1688 transitions. [2018-11-23 01:58:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 01:58:29,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:29,077 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-23 01:58:29,077 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:29,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:29,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1538505042, now seen corresponding path program 1 times [2018-11-23 01:58:29,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:29,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:29,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:29,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:29,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:29,169 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-23 01:58:29,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:29,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:29,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:29,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:29,170 INFO L87 Difference]: Start difference. First operand 1177 states and 1688 transitions. Second operand 3 states. [2018-11-23 01:58:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:29,341 INFO L93 Difference]: Finished difference Result 1200 states and 1714 transitions. [2018-11-23 01:58:29,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:29,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-23 01:58:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:29,345 INFO L225 Difference]: With dead ends: 1200 [2018-11-23 01:58:29,345 INFO L226 Difference]: Without dead ends: 1193 [2018-11-23 01:58:29,345 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-23 01:58:29,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2018-11-23 01:58:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1191. [2018-11-23 01:58:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-11-23 01:58:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1704 transitions. [2018-11-23 01:58:29,414 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1704 transitions. Word has length 58 [2018-11-23 01:58:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:29,414 INFO L480 AbstractCegarLoop]: Abstraction has 1191 states and 1704 transitions. [2018-11-23 01:58:29,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1704 transitions. [2018-11-23 01:58:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 01:58:29,417 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:29,417 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-23 01:58:29,417 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:29,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash -836966273, now seen corresponding path program 1 times [2018-11-23 01:58:29,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:29,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:29,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:29,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:29,559 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-23 01:58:29,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:29,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 01:58:29,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:58:29,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:58:29,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:58:29,560 INFO L87 Difference]: Start difference. First operand 1191 states and 1704 transitions. Second operand 10 states. [2018-11-23 01:58:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:29,926 INFO L93 Difference]: Finished difference Result 1206 states and 1719 transitions. [2018-11-23 01:58:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:58:29,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2018-11-23 01:58:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:29,933 INFO L225 Difference]: With dead ends: 1206 [2018-11-23 01:58:29,933 INFO L226 Difference]: Without dead ends: 1189 [2018-11-23 01:58:29,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:58:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2018-11-23 01:58:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1189. [2018-11-23 01:58:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1189 states. [2018-11-23 01:58:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1700 transitions. [2018-11-23 01:58:29,992 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1700 transitions. Word has length 57 [2018-11-23 01:58:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:29,993 INFO L480 AbstractCegarLoop]: Abstraction has 1189 states and 1700 transitions. [2018-11-23 01:58:29,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:58:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1700 transitions. [2018-11-23 01:58:29,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 01:58:29,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:29,995 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-23 01:58:29,996 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:29,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:29,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1406754013, now seen corresponding path program 1 times [2018-11-23 01:58:29,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:29,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:30,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:30,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:30,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:30,115 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-23 01:58:30,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:30,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:58:30,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:58:30,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:58:30,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:58:30,116 INFO L87 Difference]: Start difference. First operand 1189 states and 1700 transitions. Second operand 6 states. [2018-11-23 01:58:30,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:30,684 INFO L93 Difference]: Finished difference Result 2406 states and 3437 transitions. [2018-11-23 01:58:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:58:30,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-11-23 01:58:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:30,694 INFO L225 Difference]: With dead ends: 2406 [2018-11-23 01:58:30,694 INFO L226 Difference]: Without dead ends: 2307 [2018-11-23 01:58:30,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:58:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2018-11-23 01:58:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2182. [2018-11-23 01:58:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2182 states. [2018-11-23 01:58:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2182 states to 2182 states and 3153 transitions. [2018-11-23 01:58:30,782 INFO L78 Accepts]: Start accepts. Automaton has 2182 states and 3153 transitions. Word has length 61 [2018-11-23 01:58:30,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:30,783 INFO L480 AbstractCegarLoop]: Abstraction has 2182 states and 3153 transitions. [2018-11-23 01:58:30,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:58:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2182 states and 3153 transitions. [2018-11-23 01:58:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 01:58:30,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:30,786 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-23 01:58:30,786 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:30,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash -923910420, now seen corresponding path program 1 times [2018-11-23 01:58:30,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:30,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:30,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:30,856 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-23 01:58:30,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:30,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:30,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:30,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:30,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:30,857 INFO L87 Difference]: Start difference. First operand 2182 states and 3153 transitions. Second operand 3 states. [2018-11-23 01:58:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:30,964 INFO L93 Difference]: Finished difference Result 3201 states and 4615 transitions. [2018-11-23 01:58:30,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:30,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-23 01:58:30,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:30,971 INFO L225 Difference]: With dead ends: 3201 [2018-11-23 01:58:30,971 INFO L226 Difference]: Without dead ends: 2174 [2018-11-23 01:58:30,974 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-23 01:58:30,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2018-11-23 01:58:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2174. [2018-11-23 01:58:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2018-11-23 01:58:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 3139 transitions. [2018-11-23 01:58:31,101 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 3139 transitions. Word has length 63 [2018-11-23 01:58:31,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:31,101 INFO L480 AbstractCegarLoop]: Abstraction has 2174 states and 3139 transitions. [2018-11-23 01:58:31,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 3139 transitions. [2018-11-23 01:58:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 01:58:31,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:31,105 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] [2018-11-23 01:58:31,105 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:31,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:31,105 INFO L82 PathProgramCache]: Analyzing trace with hash -795596774, now seen corresponding path program 1 times [2018-11-23 01:58:31,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:31,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:31,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:31,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:31,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:31,250 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-23 01:58:31,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:31,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:58:31,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:58:31,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:58:31,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:58:31,251 INFO L87 Difference]: Start difference. First operand 2174 states and 3139 transitions. Second operand 5 states. [2018-11-23 01:58:31,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:31,757 INFO L93 Difference]: Finished difference Result 2182 states and 3145 transitions. [2018-11-23 01:58:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:58:31,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-11-23 01:58:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:31,762 INFO L225 Difference]: With dead ends: 2182 [2018-11-23 01:58:31,763 INFO L226 Difference]: Without dead ends: 2176 [2018-11-23 01:58:31,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:58:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2018-11-23 01:58:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2174. [2018-11-23 01:58:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2018-11-23 01:58:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 3138 transitions. [2018-11-23 01:58:31,845 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 3138 transitions. Word has length 60 [2018-11-23 01:58:31,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:31,846 INFO L480 AbstractCegarLoop]: Abstraction has 2174 states and 3138 transitions. [2018-11-23 01:58:31,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:58:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 3138 transitions. [2018-11-23 01:58:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 01:58:31,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:31,848 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-23 01:58:31,848 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:31,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:31,849 INFO L82 PathProgramCache]: Analyzing trace with hash 947889245, now seen corresponding path program 1 times [2018-11-23 01:58:31,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:31,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:31,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:31,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:31,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:31,952 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-23 01:58:31,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:31,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 01:58:31,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:58:31,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:58:31,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:58:31,953 INFO L87 Difference]: Start difference. First operand 2174 states and 3138 transitions. Second operand 10 states. [2018-11-23 01:58:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:32,236 INFO L93 Difference]: Finished difference Result 2186 states and 3150 transitions. [2018-11-23 01:58:32,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:58:32,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-11-23 01:58:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:32,240 INFO L225 Difference]: With dead ends: 2186 [2018-11-23 01:58:32,240 INFO L226 Difference]: Without dead ends: 2165 [2018-11-23 01:58:32,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:58:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2018-11-23 01:58:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 2165. [2018-11-23 01:58:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2165 states. [2018-11-23 01:58:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2165 states to 2165 states and 3125 transitions. [2018-11-23 01:58:32,322 INFO L78 Accepts]: Start accepts. Automaton has 2165 states and 3125 transitions. Word has length 59 [2018-11-23 01:58:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:32,322 INFO L480 AbstractCegarLoop]: Abstraction has 2165 states and 3125 transitions. [2018-11-23 01:58:32,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:58:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2165 states and 3125 transitions. [2018-11-23 01:58:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 01:58:32,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:32,324 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-23 01:58:32,325 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:32,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:32,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1160672351, now seen corresponding path program 1 times [2018-11-23 01:58:32,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:32,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:32,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:32,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:32,426 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-23 01:58:32,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:32,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:58:32,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:58:32,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:58:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:58:32,426 INFO L87 Difference]: Start difference. First operand 2165 states and 3125 transitions. Second operand 9 states. [2018-11-23 01:58:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:34,612 INFO L93 Difference]: Finished difference Result 2191 states and 3155 transitions. [2018-11-23 01:58:34,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:58:34,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 01:58:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:34,616 INFO L225 Difference]: With dead ends: 2191 [2018-11-23 01:58:34,616 INFO L226 Difference]: Without dead ends: 2053 [2018-11-23 01:58:34,617 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-23 01:58:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2018-11-23 01:58:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2052. [2018-11-23 01:58:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2018-11-23 01:58:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2901 transitions. [2018-11-23 01:58:34,692 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2901 transitions. Word has length 61 [2018-11-23 01:58:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:34,692 INFO L480 AbstractCegarLoop]: Abstraction has 2052 states and 2901 transitions. [2018-11-23 01:58:34,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:58:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2901 transitions. [2018-11-23 01:58:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 01:58:34,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:34,694 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-23 01:58:34,694 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:34,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:34,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1044827578, now seen corresponding path program 1 times [2018-11-23 01:58:34,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:34,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:34,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:34,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:34,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:34,796 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-23 01:58:34,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:34,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:58:34,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:58:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:58:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:58:34,797 INFO L87 Difference]: Start difference. First operand 2052 states and 2901 transitions. Second operand 9 states. [2018-11-23 01:58:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:37,119 INFO L93 Difference]: Finished difference Result 2094 states and 2965 transitions. [2018-11-23 01:58:37,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:58:37,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 01:58:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:37,123 INFO L225 Difference]: With dead ends: 2094 [2018-11-23 01:58:37,123 INFO L226 Difference]: Without dead ends: 1990 [2018-11-23 01:58:37,123 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-23 01:58:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2018-11-23 01:58:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1969. [2018-11-23 01:58:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-11-23 01:58:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2729 transitions. [2018-11-23 01:58:37,206 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2729 transitions. Word has length 61 [2018-11-23 01:58:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:37,206 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2729 transitions. [2018-11-23 01:58:37,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:58:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2729 transitions. [2018-11-23 01:58:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 01:58:37,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:37,208 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] [2018-11-23 01:58:37,209 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:37,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:37,209 INFO L82 PathProgramCache]: Analyzing trace with hash -279661211, now seen corresponding path program 1 times [2018-11-23 01:58:37,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:37,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:37,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:37,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:37,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:37,353 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-23 01:58:37,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:37,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:58:37,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:58:37,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:58:37,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:58:37,354 INFO L87 Difference]: Start difference. First operand 1969 states and 2729 transitions. Second operand 11 states. [2018-11-23 01:58:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:37,705 INFO L93 Difference]: Finished difference Result 1988 states and 2748 transitions. [2018-11-23 01:58:37,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:58:37,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-11-23 01:58:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:37,710 INFO L225 Difference]: With dead ends: 1988 [2018-11-23 01:58:37,710 INFO L226 Difference]: Without dead ends: 1963 [2018-11-23 01:58:37,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:58:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2018-11-23 01:58:37,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1963. [2018-11-23 01:58:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2018-11-23 01:58:37,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2719 transitions. [2018-11-23 01:58:37,829 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2719 transitions. Word has length 60 [2018-11-23 01:58:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:37,829 INFO L480 AbstractCegarLoop]: Abstraction has 1963 states and 2719 transitions. [2018-11-23 01:58:37,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:58:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2719 transitions. [2018-11-23 01:58:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 01:58:37,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:37,832 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-23 01:58:37,832 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:37,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1344106348, now seen corresponding path program 1 times [2018-11-23 01:58:37,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:37,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:37,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:37,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:37,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:58:38,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:38,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 01:58:38,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:58:38,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:58:38,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:58:38,037 INFO L87 Difference]: Start difference. First operand 1963 states and 2719 transitions. Second operand 13 states. [2018-11-23 01:58:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:38,457 INFO L93 Difference]: Finished difference Result 1982 states and 2738 transitions. [2018-11-23 01:58:38,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:58:38,458 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2018-11-23 01:58:38,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:38,462 INFO L225 Difference]: With dead ends: 1982 [2018-11-23 01:58:38,462 INFO L226 Difference]: Without dead ends: 1953 [2018-11-23 01:58:38,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:58:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2018-11-23 01:58:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1953. [2018-11-23 01:58:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2018-11-23 01:58:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2705 transitions. [2018-11-23 01:58:38,534 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2705 transitions. Word has length 65 [2018-11-23 01:58:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:38,534 INFO L480 AbstractCegarLoop]: Abstraction has 1953 states and 2705 transitions. [2018-11-23 01:58:38,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:58:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2705 transitions. [2018-11-23 01:58:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 01:58:38,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:38,536 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-23 01:58:38,537 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:38,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1412990541, now seen corresponding path program 1 times [2018-11-23 01:58:38,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:38,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:38,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:38,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:38,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:38,717 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-23 01:58:38,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:38,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 01:58:38,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:58:38,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:58:38,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:58:38,718 INFO L87 Difference]: Start difference. First operand 1953 states and 2705 transitions. Second operand 13 states. [2018-11-23 01:58:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:39,084 INFO L93 Difference]: Finished difference Result 1972 states and 2724 transitions. [2018-11-23 01:58:39,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:58:39,085 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-11-23 01:58:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:39,088 INFO L225 Difference]: With dead ends: 1972 [2018-11-23 01:58:39,088 INFO L226 Difference]: Without dead ends: 1943 [2018-11-23 01:58:39,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:58:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2018-11-23 01:58:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1943. [2018-11-23 01:58:39,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1943 states. [2018-11-23 01:58:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2691 transitions. [2018-11-23 01:58:39,166 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2691 transitions. Word has length 64 [2018-11-23 01:58:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:39,166 INFO L480 AbstractCegarLoop]: Abstraction has 1943 states and 2691 transitions. [2018-11-23 01:58:39,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:58:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2691 transitions. [2018-11-23 01:58:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 01:58:39,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:39,168 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-23 01:58:39,168 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:39,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:39,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1221536898, now seen corresponding path program 1 times [2018-11-23 01:58:39,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:39,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:39,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:39,286 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-23 01:58:39,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:39,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:58:39,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:58:39,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:58:39,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:58:39,287 INFO L87 Difference]: Start difference. First operand 1943 states and 2691 transitions. Second operand 4 states. [2018-11-23 01:58:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:39,623 INFO L93 Difference]: Finished difference Result 2017 states and 2773 transitions. [2018-11-23 01:58:39,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:58:39,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-23 01:58:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:39,628 INFO L225 Difference]: With dead ends: 2017 [2018-11-23 01:58:39,628 INFO L226 Difference]: Without dead ends: 1961 [2018-11-23 01:58:39,629 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-23 01:58:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-11-23 01:58:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1943. [2018-11-23 01:58:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1943 states. [2018-11-23 01:58:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 2689 transitions. [2018-11-23 01:58:39,700 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 2689 transitions. Word has length 64 [2018-11-23 01:58:39,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:39,700 INFO L480 AbstractCegarLoop]: Abstraction has 1943 states and 2689 transitions. [2018-11-23 01:58:39,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:58:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 2689 transitions. [2018-11-23 01:58:39,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 01:58:39,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:39,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, 1, 1, 1, 1, 1] [2018-11-23 01:58:39,702 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:39,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:39,702 INFO L82 PathProgramCache]: Analyzing trace with hash -929647939, now seen corresponding path program 1 times [2018-11-23 01:58:39,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:39,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:39,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:39,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:39,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:39,862 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-23 01:58:39,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:39,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:58:39,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:58:39,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:58:39,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:58:39,863 INFO L87 Difference]: Start difference. First operand 1943 states and 2689 transitions. Second operand 5 states. [2018-11-23 01:58:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:40,504 INFO L93 Difference]: Finished difference Result 3402 states and 4803 transitions. [2018-11-23 01:58:40,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:58:40,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-11-23 01:58:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:40,509 INFO L225 Difference]: With dead ends: 3402 [2018-11-23 01:58:40,509 INFO L226 Difference]: Without dead ends: 2492 [2018-11-23 01:58:40,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:58:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2018-11-23 01:58:40,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2073. [2018-11-23 01:58:40,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2073 states. [2018-11-23 01:58:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 2861 transitions. [2018-11-23 01:58:40,610 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 2861 transitions. Word has length 68 [2018-11-23 01:58:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:40,610 INFO L480 AbstractCegarLoop]: Abstraction has 2073 states and 2861 transitions. [2018-11-23 01:58:40,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:58:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 2861 transitions. [2018-11-23 01:58:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 01:58:40,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:40,613 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-23 01:58:40,613 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:40,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:40,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1068777024, now seen corresponding path program 1 times [2018-11-23 01:58:40,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:40,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:40,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:40,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:40,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:40,674 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-23 01:58:40,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:40,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 01:58:40,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 01:58:40,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 01:58:40,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 01:58:40,675 INFO L87 Difference]: Start difference. First operand 2073 states and 2861 transitions. Second operand 4 states. [2018-11-23 01:58:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:40,847 INFO L93 Difference]: Finished difference Result 2342 states and 3307 transitions. [2018-11-23 01:58:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 01:58:40,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-23 01:58:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:40,853 INFO L225 Difference]: With dead ends: 2342 [2018-11-23 01:58:40,853 INFO L226 Difference]: Without dead ends: 2177 [2018-11-23 01:58:40,855 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-23 01:58:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2018-11-23 01:58:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 2095. [2018-11-23 01:58:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2095 states. [2018-11-23 01:58:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 2897 transitions. [2018-11-23 01:58:40,942 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 2897 transitions. Word has length 66 [2018-11-23 01:58:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:40,943 INFO L480 AbstractCegarLoop]: Abstraction has 2095 states and 2897 transitions. [2018-11-23 01:58:40,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 01:58:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2897 transitions. [2018-11-23 01:58:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 01:58:40,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:40,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] [2018-11-23 01:58:40,945 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:40,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1343536638, now seen corresponding path program 1 times [2018-11-23 01:58:40,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:40,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:40,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:40,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:41,043 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-23 01:58:41,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:41,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:58:41,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:58:41,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:58:41,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:58:41,044 INFO L87 Difference]: Start difference. First operand 2095 states and 2897 transitions. Second operand 9 states. [2018-11-23 01:58:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:42,624 INFO L93 Difference]: Finished difference Result 2116 states and 2920 transitions. [2018-11-23 01:58:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:58:42,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2018-11-23 01:58:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:42,628 INFO L225 Difference]: With dead ends: 2116 [2018-11-23 01:58:42,628 INFO L226 Difference]: Without dead ends: 2093 [2018-11-23 01:58:42,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:58:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2018-11-23 01:58:42,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 2093. [2018-11-23 01:58:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2093 states. [2018-11-23 01:58:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 2893 transitions. [2018-11-23 01:58:42,712 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 2893 transitions. Word has length 66 [2018-11-23 01:58:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:42,712 INFO L480 AbstractCegarLoop]: Abstraction has 2093 states and 2893 transitions. [2018-11-23 01:58:42,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:58:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2893 transitions. [2018-11-23 01:58:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 01:58:42,714 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:42,714 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] [2018-11-23 01:58:42,714 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:42,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:42,715 INFO L82 PathProgramCache]: Analyzing trace with hash 704382255, now seen corresponding path program 1 times [2018-11-23 01:58:42,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:42,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:42,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:42,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:42,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:42,833 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-23 01:58:42,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:42,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:58:42,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:58:42,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:58:42,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:58:42,834 INFO L87 Difference]: Start difference. First operand 2093 states and 2893 transitions. Second operand 11 states. [2018-11-23 01:58:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:45,015 INFO L93 Difference]: Finished difference Result 2151 states and 2984 transitions. [2018-11-23 01:58:45,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:58:45,015 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-11-23 01:58:45,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:45,019 INFO L225 Difference]: With dead ends: 2151 [2018-11-23 01:58:45,019 INFO L226 Difference]: Without dead ends: 2125 [2018-11-23 01:58:45,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:58:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2018-11-23 01:58:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2105. [2018-11-23 01:58:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2105 states. [2018-11-23 01:58:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2929 transitions. [2018-11-23 01:58:45,105 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2929 transitions. Word has length 67 [2018-11-23 01:58:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:45,105 INFO L480 AbstractCegarLoop]: Abstraction has 2105 states and 2929 transitions. [2018-11-23 01:58:45,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:58:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2929 transitions. [2018-11-23 01:58:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 01:58:45,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:45,107 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-23 01:58:45,107 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:45,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:45,108 INFO L82 PathProgramCache]: Analyzing trace with hash -468866066, now seen corresponding path program 1 times [2018-11-23 01:58:45,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:45,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:45,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:45,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:45,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:45,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-23 01:58:45,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:45,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:45,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:45,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:45,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:45,165 INFO L87 Difference]: Start difference. First operand 2105 states and 2929 transitions. Second operand 3 states. [2018-11-23 01:58:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:45,275 INFO L93 Difference]: Finished difference Result 3061 states and 4322 transitions. [2018-11-23 01:58:45,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:45,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-23 01:58:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:45,279 INFO L225 Difference]: With dead ends: 3061 [2018-11-23 01:58:45,279 INFO L226 Difference]: Without dead ends: 1925 [2018-11-23 01:58:45,281 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-23 01:58:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2018-11-23 01:58:45,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1713. [2018-11-23 01:58:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2018-11-23 01:58:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2309 transitions. [2018-11-23 01:58:45,350 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2309 transitions. Word has length 69 [2018-11-23 01:58:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:45,350 INFO L480 AbstractCegarLoop]: Abstraction has 1713 states and 2309 transitions. [2018-11-23 01:58:45,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2309 transitions. [2018-11-23 01:58:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 01:58:45,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:45,351 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:58:45,351 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:45,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1977644941, now seen corresponding path program 1 times [2018-11-23 01:58:45,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:45,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:45,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:45,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:45,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:58:45,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:45,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:45,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:45,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:45,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:45,432 INFO L87 Difference]: Start difference. First operand 1713 states and 2309 transitions. Second operand 3 states. [2018-11-23 01:58:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:45,510 INFO L93 Difference]: Finished difference Result 2663 states and 3657 transitions. [2018-11-23 01:58:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:45,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-11-23 01:58:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:45,514 INFO L225 Difference]: With dead ends: 2663 [2018-11-23 01:58:45,515 INFO L226 Difference]: Without dead ends: 1759 [2018-11-23 01:58:45,517 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-23 01:58:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2018-11-23 01:58:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1722. [2018-11-23 01:58:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2018-11-23 01:58:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2321 transitions. [2018-11-23 01:58:45,599 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2321 transitions. Word has length 86 [2018-11-23 01:58:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:45,599 INFO L480 AbstractCegarLoop]: Abstraction has 1722 states and 2321 transitions. [2018-11-23 01:58:45,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:45,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2321 transitions. [2018-11-23 01:58:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 01:58:45,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:45,602 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-23 01:58:45,602 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:45,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1091293541, now seen corresponding path program 1 times [2018-11-23 01:58:45,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:45,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:45,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:45,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:45,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:45,685 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-23 01:58:45,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:45,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:45,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:45,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:45,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:45,686 INFO L87 Difference]: Start difference. First operand 1722 states and 2321 transitions. Second operand 3 states. [2018-11-23 01:58:47,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:47,783 INFO L93 Difference]: Finished difference Result 2591 states and 3571 transitions. [2018-11-23 01:58:47,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:47,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-11-23 01:58:47,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:47,787 INFO L225 Difference]: With dead ends: 2591 [2018-11-23 01:58:47,787 INFO L226 Difference]: Without dead ends: 1722 [2018-11-23 01:58:47,790 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-23 01:58:47,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2018-11-23 01:58:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2018-11-23 01:58:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2018-11-23 01:58:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 2315 transitions. [2018-11-23 01:58:47,859 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 2315 transitions. Word has length 73 [2018-11-23 01:58:47,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:47,859 INFO L480 AbstractCegarLoop]: Abstraction has 1722 states and 2315 transitions. [2018-11-23 01:58:47,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:47,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2315 transitions. [2018-11-23 01:58:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 01:58:47,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:47,860 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-23 01:58:47,861 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:47,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:47,861 INFO L82 PathProgramCache]: Analyzing trace with hash 612860501, now seen corresponding path program 1 times [2018-11-23 01:58:47,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:47,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:47,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:47,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:47,996 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-23 01:58:47,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:47,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:58:47,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:58:47,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:58:47,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:58:47,997 INFO L87 Difference]: Start difference. First operand 1722 states and 2315 transitions. Second operand 11 states. [2018-11-23 01:58:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:50,175 INFO L93 Difference]: Finished difference Result 1747 states and 2343 transitions. [2018-11-23 01:58:50,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:58:50,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-23 01:58:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:50,179 INFO L225 Difference]: With dead ends: 1747 [2018-11-23 01:58:50,179 INFO L226 Difference]: Without dead ends: 1717 [2018-11-23 01:58:50,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:58:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2018-11-23 01:58:50,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1717. [2018-11-23 01:58:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2018-11-23 01:58:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2306 transitions. [2018-11-23 01:58:50,252 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2306 transitions. Word has length 71 [2018-11-23 01:58:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:50,252 INFO L480 AbstractCegarLoop]: Abstraction has 1717 states and 2306 transitions. [2018-11-23 01:58:50,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:58:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2306 transitions. [2018-11-23 01:58:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 01:58:50,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:50,254 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-23 01:58:50,254 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:50,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1516939417, now seen corresponding path program 1 times [2018-11-23 01:58:50,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:50,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:50,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:50,380 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-23 01:58:50,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:50,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:58:50,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:58:50,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:58:50,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:58:50,381 INFO L87 Difference]: Start difference. First operand 1717 states and 2306 transitions. Second operand 11 states. [2018-11-23 01:58:53,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:53,130 INFO L93 Difference]: Finished difference Result 1742 states and 2334 transitions. [2018-11-23 01:58:53,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:58:53,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-23 01:58:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:53,134 INFO L225 Difference]: With dead ends: 1742 [2018-11-23 01:58:53,134 INFO L226 Difference]: Without dead ends: 1717 [2018-11-23 01:58:53,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:58:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2018-11-23 01:58:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1713. [2018-11-23 01:58:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2018-11-23 01:58:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2300 transitions. [2018-11-23 01:58:53,211 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2300 transitions. Word has length 71 [2018-11-23 01:58:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:53,211 INFO L480 AbstractCegarLoop]: Abstraction has 1713 states and 2300 transitions. [2018-11-23 01:58:53,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:58:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2300 transitions. [2018-11-23 01:58:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 01:58:53,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:53,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:58:53,214 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:53,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2069143513, now seen corresponding path program 1 times [2018-11-23 01:58:53,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:53,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:53,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:53,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:53,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:58:53,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:53,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:53,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:53,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:53,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:53,284 INFO L87 Difference]: Start difference. First operand 1713 states and 2300 transitions. Second operand 3 states. [2018-11-23 01:58:53,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:53,361 INFO L93 Difference]: Finished difference Result 2663 states and 3646 transitions. [2018-11-23 01:58:53,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:53,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-11-23 01:58:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:53,364 INFO L225 Difference]: With dead ends: 2663 [2018-11-23 01:58:53,364 INFO L226 Difference]: Without dead ends: 1759 [2018-11-23 01:58:53,366 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-23 01:58:53,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2018-11-23 01:58:53,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1713. [2018-11-23 01:58:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2018-11-23 01:58:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2300 transitions. [2018-11-23 01:58:53,451 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2300 transitions. Word has length 87 [2018-11-23 01:58:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:53,451 INFO L480 AbstractCegarLoop]: Abstraction has 1713 states and 2300 transitions. [2018-11-23 01:58:53,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2300 transitions. [2018-11-23 01:58:53,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 01:58:53,452 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:53,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:58:53,453 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:53,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:53,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1513349095, now seen corresponding path program 1 times [2018-11-23 01:58:53,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:53,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:53,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:53,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:53,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:53,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:58:53,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:53,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 01:58:53,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 01:58:53,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 01:58:53,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 01:58:53,573 INFO L87 Difference]: Start difference. First operand 1713 states and 2300 transitions. Second operand 3 states. [2018-11-23 01:58:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:53,679 INFO L93 Difference]: Finished difference Result 2988 states and 4137 transitions. [2018-11-23 01:58:53,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 01:58:53,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-11-23 01:58:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:53,683 INFO L225 Difference]: With dead ends: 2988 [2018-11-23 01:58:53,683 INFO L226 Difference]: Without dead ends: 2132 [2018-11-23 01:58:53,684 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-23 01:58:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2018-11-23 01:58:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2074. [2018-11-23 01:58:53,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2018-11-23 01:58:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2829 transitions. [2018-11-23 01:58:53,770 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2829 transitions. Word has length 87 [2018-11-23 01:58:53,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:53,770 INFO L480 AbstractCegarLoop]: Abstraction has 2074 states and 2829 transitions. [2018-11-23 01:58:53,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 01:58:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2829 transitions. [2018-11-23 01:58:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 01:58:53,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:53,772 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-23 01:58:53,772 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:53,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:53,772 INFO L82 PathProgramCache]: Analyzing trace with hash -879932007, now seen corresponding path program 1 times [2018-11-23 01:58:53,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:53,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:53,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:53,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:53,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:53,913 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-23 01:58:53,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:53,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:58:53,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:58:53,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:58:53,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:58:53,913 INFO L87 Difference]: Start difference. First operand 2074 states and 2829 transitions. Second operand 11 states. [2018-11-23 01:58:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:56,106 INFO L93 Difference]: Finished difference Result 2099 states and 2857 transitions. [2018-11-23 01:58:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:58:56,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-11-23 01:58:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:56,110 INFO L225 Difference]: With dead ends: 2099 [2018-11-23 01:58:56,110 INFO L226 Difference]: Without dead ends: 2066 [2018-11-23 01:58:56,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:58:56,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states. [2018-11-23 01:58:56,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 2066. [2018-11-23 01:58:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2066 states. [2018-11-23 01:58:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2817 transitions. [2018-11-23 01:58:56,197 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2817 transitions. Word has length 72 [2018-11-23 01:58:56,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:56,197 INFO L480 AbstractCegarLoop]: Abstraction has 2066 states and 2817 transitions. [2018-11-23 01:58:56,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:58:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2817 transitions. [2018-11-23 01:58:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 01:58:56,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:56,199 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-23 01:58:56,200 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:56,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1229911199, now seen corresponding path program 1 times [2018-11-23 01:58:56,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:56,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:56,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:56,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:56,363 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-23 01:58:56,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:56,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:58:56,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:58:56,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:58:56,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:58:56,364 INFO L87 Difference]: Start difference. First operand 2066 states and 2817 transitions. Second operand 11 states. [2018-11-23 01:58:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:58:59,080 INFO L93 Difference]: Finished difference Result 2100 states and 2856 transitions. [2018-11-23 01:58:59,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:58:59,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2018-11-23 01:58:59,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:58:59,085 INFO L225 Difference]: With dead ends: 2100 [2018-11-23 01:58:59,085 INFO L226 Difference]: Without dead ends: 2067 [2018-11-23 01:58:59,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:58:59,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2018-11-23 01:58:59,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2058. [2018-11-23 01:58:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2018-11-23 01:58:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2805 transitions. [2018-11-23 01:58:59,176 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2805 transitions. Word has length 72 [2018-11-23 01:58:59,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:58:59,176 INFO L480 AbstractCegarLoop]: Abstraction has 2058 states and 2805 transitions. [2018-11-23 01:58:59,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:58:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2805 transitions. [2018-11-23 01:58:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 01:58:59,178 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:58:59,178 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-23 01:58:59,178 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:58:59,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:58:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash -334111482, now seen corresponding path program 1 times [2018-11-23 01:58:59,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:58:59,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:58:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:59,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:58:59,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:58:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:58:59,326 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-23 01:58:59,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:58:59,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:58:59,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:58:59,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:58:59,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:58:59,327 INFO L87 Difference]: Start difference. First operand 2058 states and 2805 transitions. Second operand 11 states. [2018-11-23 01:59:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:00,726 INFO L93 Difference]: Finished difference Result 2092 states and 2844 transitions. [2018-11-23 01:59:00,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:59:00,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-23 01:59:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:00,732 INFO L225 Difference]: With dead ends: 2092 [2018-11-23 01:59:00,733 INFO L226 Difference]: Without dead ends: 2059 [2018-11-23 01:59:00,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:59:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2018-11-23 01:59:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2050. [2018-11-23 01:59:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2018-11-23 01:59:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2793 transitions. [2018-11-23 01:59:00,822 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2793 transitions. Word has length 74 [2018-11-23 01:59:00,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:00,823 INFO L480 AbstractCegarLoop]: Abstraction has 2050 states and 2793 transitions. [2018-11-23 01:59:00,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:59:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2793 transitions. [2018-11-23 01:59:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 01:59:00,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:00,824 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-23 01:59:00,824 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:00,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:00,824 INFO L82 PathProgramCache]: Analyzing trace with hash 659707937, now seen corresponding path program 1 times [2018-11-23 01:59:00,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:00,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:00,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:00,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:00,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:00,949 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-23 01:59:00,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:00,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:59:00,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:59:00,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:59:00,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:59:00,950 INFO L87 Difference]: Start difference. First operand 2050 states and 2793 transitions. Second operand 11 states. [2018-11-23 01:59:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:03,437 INFO L93 Difference]: Finished difference Result 2084 states and 2832 transitions. [2018-11-23 01:59:03,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:59:03,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-23 01:59:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:03,442 INFO L225 Difference]: With dead ends: 2084 [2018-11-23 01:59:03,442 INFO L226 Difference]: Without dead ends: 2054 [2018-11-23 01:59:03,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:59:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2018-11-23 01:59:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2045. [2018-11-23 01:59:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2018-11-23 01:59:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2784 transitions. [2018-11-23 01:59:03,587 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2784 transitions. Word has length 74 [2018-11-23 01:59:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:03,587 INFO L480 AbstractCegarLoop]: Abstraction has 2045 states and 2784 transitions. [2018-11-23 01:59:03,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:59:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2784 transitions. [2018-11-23 01:59:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 01:59:03,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:03,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] [2018-11-23 01:59:03,590 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:03,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:03,590 INFO L82 PathProgramCache]: Analyzing trace with hash -772231334, now seen corresponding path program 1 times [2018-11-23 01:59:03,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:03,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:03,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:03,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:03,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:03,717 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-23 01:59:03,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:03,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:59:03,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:59:03,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:59:03,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:59:03,718 INFO L87 Difference]: Start difference. First operand 2045 states and 2784 transitions. Second operand 11 states. [2018-11-23 01:59:05,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:05,916 INFO L93 Difference]: Finished difference Result 2070 states and 2812 transitions. [2018-11-23 01:59:05,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:59:05,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-11-23 01:59:05,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:05,920 INFO L225 Difference]: With dead ends: 2070 [2018-11-23 01:59:05,920 INFO L226 Difference]: Without dead ends: 2026 [2018-11-23 01:59:05,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:59:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2018-11-23 01:59:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2018-11-23 01:59:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-11-23 01:59:06,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2754 transitions. [2018-11-23 01:59:06,008 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2754 transitions. Word has length 75 [2018-11-23 01:59:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:06,008 INFO L480 AbstractCegarLoop]: Abstraction has 2026 states and 2754 transitions. [2018-11-23 01:59:06,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:59:06,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2754 transitions. [2018-11-23 01:59:06,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 01:59:06,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:06,009 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] [2018-11-23 01:59:06,010 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:06,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:06,010 INFO L82 PathProgramCache]: Analyzing trace with hash -760892519, now seen corresponding path program 1 times [2018-11-23 01:59:06,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:06,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:06,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:06,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:06,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:06,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:59:06,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:06,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:59:06,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:59:06,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:59:06,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:59:06,099 INFO L87 Difference]: Start difference. First operand 2026 states and 2754 transitions. Second operand 5 states. [2018-11-23 01:59:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:06,692 INFO L93 Difference]: Finished difference Result 2443 states and 3355 transitions. [2018-11-23 01:59:06,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 01:59:06,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-23 01:59:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:06,696 INFO L225 Difference]: With dead ends: 2443 [2018-11-23 01:59:06,696 INFO L226 Difference]: Without dead ends: 2437 [2018-11-23 01:59:06,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-23 01:59:06,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2018-11-23 01:59:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2026. [2018-11-23 01:59:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-11-23 01:59:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2753 transitions. [2018-11-23 01:59:06,794 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2753 transitions. Word has length 75 [2018-11-23 01:59:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:06,794 INFO L480 AbstractCegarLoop]: Abstraction has 2026 states and 2753 transitions. [2018-11-23 01:59:06,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:59:06,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2753 transitions. [2018-11-23 01:59:06,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 01:59:06,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:06,796 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-23 01:59:06,796 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:06,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:06,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1284032019, now seen corresponding path program 1 times [2018-11-23 01:59:06,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:06,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:06,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:06,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:06,934 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-23 01:59:06,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:06,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:59:06,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:59:06,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:59:06,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:59:06,935 INFO L87 Difference]: Start difference. First operand 2026 states and 2753 transitions. Second operand 11 states. [2018-11-23 01:59:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:07,293 INFO L93 Difference]: Finished difference Result 2036 states and 2762 transitions. [2018-11-23 01:59:07,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:59:07,293 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2018-11-23 01:59:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:07,296 INFO L225 Difference]: With dead ends: 2036 [2018-11-23 01:59:07,296 INFO L226 Difference]: Without dead ends: 2030 [2018-11-23 01:59:07,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:59:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2018-11-23 01:59:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2007. [2018-11-23 01:59:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2018-11-23 01:59:07,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2731 transitions. [2018-11-23 01:59:07,387 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2731 transitions. Word has length 76 [2018-11-23 01:59:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:07,387 INFO L480 AbstractCegarLoop]: Abstraction has 2007 states and 2731 transitions. [2018-11-23 01:59:07,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:59:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2731 transitions. [2018-11-23 01:59:07,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 01:59:07,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:07,389 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-23 01:59:07,389 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:07,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:07,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1283755189, now seen corresponding path program 1 times [2018-11-23 01:59:07,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:07,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:07,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:07,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:07,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:07,515 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-23 01:59:07,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:07,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:59:07,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:59:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:59:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:59:07,516 INFO L87 Difference]: Start difference. First operand 2007 states and 2731 transitions. Second operand 5 states. [2018-11-23 01:59:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:08,112 INFO L93 Difference]: Finished difference Result 2418 states and 3327 transitions. [2018-11-23 01:59:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:59:08,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-23 01:59:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:08,117 INFO L225 Difference]: With dead ends: 2418 [2018-11-23 01:59:08,117 INFO L226 Difference]: Without dead ends: 2347 [2018-11-23 01:59:08,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:59:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2018-11-23 01:59:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 1936. [2018-11-23 01:59:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-11-23 01:59:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2648 transitions. [2018-11-23 01:59:08,221 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2648 transitions. Word has length 76 [2018-11-23 01:59:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:08,222 INFO L480 AbstractCegarLoop]: Abstraction has 1936 states and 2648 transitions. [2018-11-23 01:59:08,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:59:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2648 transitions. [2018-11-23 01:59:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 01:59:08,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:08,224 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-23 01:59:08,224 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:08,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:08,224 INFO L82 PathProgramCache]: Analyzing trace with hash 147111831, now seen corresponding path program 1 times [2018-11-23 01:59:08,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:08,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:08,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:08,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:08,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:08,413 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-23 01:59:08,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:08,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 01:59:08,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:59:08,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:59:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:59:08,414 INFO L87 Difference]: Start difference. First operand 1936 states and 2648 transitions. Second operand 13 states. [2018-11-23 01:59:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:08,838 INFO L93 Difference]: Finished difference Result 1961 states and 2673 transitions. [2018-11-23 01:59:08,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:59:08,839 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-11-23 01:59:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:08,842 INFO L225 Difference]: With dead ends: 1961 [2018-11-23 01:59:08,842 INFO L226 Difference]: Without dead ends: 1932 [2018-11-23 01:59:08,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:59:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2018-11-23 01:59:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1932. [2018-11-23 01:59:08,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1932 states. [2018-11-23 01:59:08,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2640 transitions. [2018-11-23 01:59:08,933 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2640 transitions. Word has length 80 [2018-11-23 01:59:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:08,933 INFO L480 AbstractCegarLoop]: Abstraction has 1932 states and 2640 transitions. [2018-11-23 01:59:08,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:59:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2640 transitions. [2018-11-23 01:59:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 01:59:08,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:08,935 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] [2018-11-23 01:59:08,935 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:08,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:08,935 INFO L82 PathProgramCache]: Analyzing trace with hash 163273419, now seen corresponding path program 1 times [2018-11-23 01:59:08,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:08,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:08,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:09,129 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-23 01:59:09,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:09,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 01:59:09,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:59:09,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:59:09,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:59:09,130 INFO L87 Difference]: Start difference. First operand 1932 states and 2640 transitions. Second operand 13 states. [2018-11-23 01:59:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:09,588 INFO L93 Difference]: Finished difference Result 1951 states and 2659 transitions. [2018-11-23 01:59:09,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:59:09,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2018-11-23 01:59:09,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:09,591 INFO L225 Difference]: With dead ends: 1951 [2018-11-23 01:59:09,591 INFO L226 Difference]: Without dead ends: 1906 [2018-11-23 01:59:09,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:59:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2018-11-23 01:59:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1906. [2018-11-23 01:59:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2018-11-23 01:59:09,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2608 transitions. [2018-11-23 01:59:09,671 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2608 transitions. Word has length 87 [2018-11-23 01:59:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:09,672 INFO L480 AbstractCegarLoop]: Abstraction has 1906 states and 2608 transitions. [2018-11-23 01:59:09,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:59:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2608 transitions. [2018-11-23 01:59:09,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 01:59:09,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:09,674 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] [2018-11-23 01:59:09,674 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:09,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:09,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2002448205, now seen corresponding path program 1 times [2018-11-23 01:59:09,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:09,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:09,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:09,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:09,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:09,796 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-23 01:59:09,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 01:59:09,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 01:59:09,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 01:59:09,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:59:09,797 INFO L87 Difference]: Start difference. First operand 1906 states and 2608 transitions. Second operand 13 states. [2018-11-23 01:59:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:10,142 INFO L93 Difference]: Finished difference Result 1908 states and 2609 transitions. [2018-11-23 01:59:10,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 01:59:10,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2018-11-23 01:59:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:10,145 INFO L225 Difference]: With dead ends: 1908 [2018-11-23 01:59:10,145 INFO L226 Difference]: Without dead ends: 1791 [2018-11-23 01:59:10,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 01:59:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2018-11-23 01:59:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1720. [2018-11-23 01:59:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1720 states. [2018-11-23 01:59:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2375 transitions. [2018-11-23 01:59:10,221 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2375 transitions. Word has length 77 [2018-11-23 01:59:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:10,221 INFO L480 AbstractCegarLoop]: Abstraction has 1720 states and 2375 transitions. [2018-11-23 01:59:10,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 01:59:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2375 transitions. [2018-11-23 01:59:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 01:59:10,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:10,222 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:59:10,222 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:10,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:10,223 INFO L82 PathProgramCache]: Analyzing trace with hash -192720849, now seen corresponding path program 1 times [2018-11-23 01:59:10,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:10,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:10,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:10,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 01:59:10,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:59:10,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/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-23 01:59:10,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:10,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:59:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 01:59:10,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:59:10,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-23 01:59:10,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:59:10,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:59:10,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:59:10,599 INFO L87 Difference]: Start difference. First operand 1720 states and 2375 transitions. Second operand 7 states. [2018-11-23 01:59:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:12,967 INFO L93 Difference]: Finished difference Result 2812 states and 3986 transitions. [2018-11-23 01:59:12,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:59:12,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2018-11-23 01:59:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:12,977 INFO L225 Difference]: With dead ends: 2812 [2018-11-23 01:59:12,977 INFO L226 Difference]: Without dead ends: 1727 [2018-11-23 01:59:12,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:59:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2018-11-23 01:59:13,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1727. [2018-11-23 01:59:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1727 states. [2018-11-23 01:59:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2381 transitions. [2018-11-23 01:59:13,157 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2381 transitions. Word has length 80 [2018-11-23 01:59:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:13,157 INFO L480 AbstractCegarLoop]: Abstraction has 1727 states and 2381 transitions. [2018-11-23 01:59:13,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:59:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2381 transitions. [2018-11-23 01:59:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 01:59:13,159 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:13,160 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] [2018-11-23 01:59:13,160 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:13,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:13,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1816963303, now seen corresponding path program 1 times [2018-11-23 01:59:13,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:13,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:13,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:13,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:13,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:13,328 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-23 01:59:13,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:13,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:59:13,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:59:13,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:59:13,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:59:13,329 INFO L87 Difference]: Start difference. First operand 1727 states and 2381 transitions. Second operand 5 states. [2018-11-23 01:59:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:13,484 INFO L93 Difference]: Finished difference Result 2602 states and 3633 transitions. [2018-11-23 01:59:13,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:59:13,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2018-11-23 01:59:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:13,495 INFO L225 Difference]: With dead ends: 2602 [2018-11-23 01:59:13,495 INFO L226 Difference]: Without dead ends: 1713 [2018-11-23 01:59:13,498 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-23 01:59:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2018-11-23 01:59:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1713. [2018-11-23 01:59:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2018-11-23 01:59:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2361 transitions. [2018-11-23 01:59:13,716 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2361 transitions. Word has length 83 [2018-11-23 01:59:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:13,716 INFO L480 AbstractCegarLoop]: Abstraction has 1713 states and 2361 transitions. [2018-11-23 01:59:13,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:59:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2361 transitions. [2018-11-23 01:59:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 01:59:13,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:13,718 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-23 01:59:13,718 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:13,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:13,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1997097739, now seen corresponding path program 1 times [2018-11-23 01:59:13,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:13,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:13,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:13,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:13,888 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-23 01:59:13,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:13,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 01:59:13,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 01:59:13,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 01:59:13,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 01:59:13,889 INFO L87 Difference]: Start difference. First operand 1713 states and 2361 transitions. Second operand 6 states. [2018-11-23 01:59:29,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:29,538 INFO L93 Difference]: Finished difference Result 1911 states and 2586 transitions. [2018-11-23 01:59:29,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 01:59:29,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-23 01:59:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:29,542 INFO L225 Difference]: With dead ends: 1911 [2018-11-23 01:59:29,542 INFO L226 Difference]: Without dead ends: 1864 [2018-11-23 01:59:29,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:59:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2018-11-23 01:59:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1828. [2018-11-23 01:59:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2018-11-23 01:59:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2498 transitions. [2018-11-23 01:59:29,692 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2498 transitions. Word has length 80 [2018-11-23 01:59:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:29,692 INFO L480 AbstractCegarLoop]: Abstraction has 1828 states and 2498 transitions. [2018-11-23 01:59:29,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 01:59:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2498 transitions. [2018-11-23 01:59:29,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 01:59:29,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:29,696 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:59:29,696 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:29,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:29,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1338813812, now seen corresponding path program 1 times [2018-11-23 01:59:29,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:29,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:29,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:29,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 01:59:29,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:29,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:59:29,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:59:29,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:59:29,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:59:29,862 INFO L87 Difference]: Start difference. First operand 1828 states and 2498 transitions. Second operand 11 states. [2018-11-23 01:59:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:32,293 INFO L93 Difference]: Finished difference Result 1863 states and 2535 transitions. [2018-11-23 01:59:32,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:59:32,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2018-11-23 01:59:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:32,300 INFO L225 Difference]: With dead ends: 1863 [2018-11-23 01:59:32,300 INFO L226 Difference]: Without dead ends: 1808 [2018-11-23 01:59:32,301 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-23 01:59:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2018-11-23 01:59:32,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1808. [2018-11-23 01:59:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1808 states. [2018-11-23 01:59:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2470 transitions. [2018-11-23 01:59:32,456 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2470 transitions. Word has length 81 [2018-11-23 01:59:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:32,456 INFO L480 AbstractCegarLoop]: Abstraction has 1808 states and 2470 transitions. [2018-11-23 01:59:32,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:59:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2470 transitions. [2018-11-23 01:59:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 01:59:32,458 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:32,458 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] [2018-11-23 01:59:32,459 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:32,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash 48464850, now seen corresponding path program 1 times [2018-11-23 01:59:32,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:32,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:32,582 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-23 01:59:32,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:32,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 01:59:32,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 01:59:32,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 01:59:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 01:59:32,583 INFO L87 Difference]: Start difference. First operand 1808 states and 2470 transitions. Second operand 5 states. [2018-11-23 01:59:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:32,947 INFO L93 Difference]: Finished difference Result 2666 states and 3699 transitions. [2018-11-23 01:59:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 01:59:32,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2018-11-23 01:59:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:32,952 INFO L225 Difference]: With dead ends: 2666 [2018-11-23 01:59:32,952 INFO L226 Difference]: Without dead ends: 1780 [2018-11-23 01:59:32,953 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-23 01:59:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2018-11-23 01:59:33,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1778. [2018-11-23 01:59:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-11-23 01:59:33,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2430 transitions. [2018-11-23 01:59:33,039 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2430 transitions. Word has length 87 [2018-11-23 01:59:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:33,039 INFO L480 AbstractCegarLoop]: Abstraction has 1778 states and 2430 transitions. [2018-11-23 01:59:33,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 01:59:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2430 transitions. [2018-11-23 01:59:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 01:59:33,041 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:33,041 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] [2018-11-23 01:59:33,041 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:33,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1197043494, now seen corresponding path program 1 times [2018-11-23 01:59:33,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:33,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:33,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:33,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:33,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:59:33,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:33,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:59:33,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:59:33,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:59:33,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:59:33,171 INFO L87 Difference]: Start difference. First operand 1778 states and 2430 transitions. Second operand 9 states. [2018-11-23 01:59:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:36,215 INFO L93 Difference]: Finished difference Result 1909 states and 2570 transitions. [2018-11-23 01:59:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:59:36,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-11-23 01:59:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:36,218 INFO L225 Difference]: With dead ends: 1909 [2018-11-23 01:59:36,218 INFO L226 Difference]: Without dead ends: 1836 [2018-11-23 01:59:36,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:59:36,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2018-11-23 01:59:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1788. [2018-11-23 01:59:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1788 states. [2018-11-23 01:59:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 2442 transitions. [2018-11-23 01:59:36,342 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 2442 transitions. Word has length 86 [2018-11-23 01:59:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:36,342 INFO L480 AbstractCegarLoop]: Abstraction has 1788 states and 2442 transitions. [2018-11-23 01:59:36,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:59:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 2442 transitions. [2018-11-23 01:59:36,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 01:59:36,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:36,343 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] [2018-11-23 01:59:36,343 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:36,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:36,344 INFO L82 PathProgramCache]: Analyzing trace with hash -227462471, now seen corresponding path program 1 times [2018-11-23 01:59:36,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:36,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:36,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:36,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:36,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 01:59:36,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:36,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 01:59:36,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 01:59:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 01:59:36,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:59:36,566 INFO L87 Difference]: Start difference. First operand 1788 states and 2442 transitions. Second operand 11 states. [2018-11-23 01:59:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:59:38,746 INFO L93 Difference]: Finished difference Result 1809 states and 2463 transitions. [2018-11-23 01:59:38,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 01:59:38,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2018-11-23 01:59:38,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:59:38,750 INFO L225 Difference]: With dead ends: 1809 [2018-11-23 01:59:38,750 INFO L226 Difference]: Without dead ends: 1738 [2018-11-23 01:59:38,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:59:38,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-23 01:59:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1728. [2018-11-23 01:59:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1728 states. [2018-11-23 01:59:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2366 transitions. [2018-11-23 01:59:38,876 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2366 transitions. Word has length 86 [2018-11-23 01:59:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:59:38,877 INFO L480 AbstractCegarLoop]: Abstraction has 1728 states and 2366 transitions. [2018-11-23 01:59:38,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 01:59:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2366 transitions. [2018-11-23 01:59:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 01:59:38,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:59:38,878 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] [2018-11-23 01:59:38,878 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:59:38,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:59:38,879 INFO L82 PathProgramCache]: Analyzing trace with hash -612468662, now seen corresponding path program 1 times [2018-11-23 01:59:38,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 01:59:38,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 01:59:38,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:38,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:59:38,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:59:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:59:39,026 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-23 01:59:39,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:59:39,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:59:39,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:59:39,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:59:39,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:59:39,027 INFO L87 Difference]: Start difference. First operand 1728 states and 2366 transitions. Second operand 9 states. [2018-11-23 02:00:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:58,510 INFO L93 Difference]: Finished difference Result 1754 states and 2391 transitions. [2018-11-23 02:00:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:00:58,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-11-23 02:00:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:58,513 INFO L225 Difference]: With dead ends: 1754 [2018-11-23 02:00:58,513 INFO L226 Difference]: Without dead ends: 1683 [2018-11-23 02:00:58,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:00:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2018-11-23 02:00:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 850. [2018-11-23 02:00:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-23 02:00:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1164 transitions. [2018-11-23 02:00:58,593 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1164 transitions. Word has length 86 [2018-11-23 02:00:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:58,593 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1164 transitions. [2018-11-23 02:00:58,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:00:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1164 transitions. [2018-11-23 02:00:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 02:00:58,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:58,593 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-23 02:00:58,594 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:58,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:58,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1194795759, now seen corresponding path program 1 times [2018-11-23 02:00:58,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:58,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:58,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:58,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:58,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:58,700 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-23 02:00:58,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:58,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:00:58,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:00:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:00:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:00:58,702 INFO L87 Difference]: Start difference. First operand 850 states and 1164 transitions. Second operand 4 states. [2018-11-23 02:00:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:58,915 INFO L93 Difference]: Finished difference Result 1568 states and 2173 transitions. [2018-11-23 02:00:58,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:00:58,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-23 02:00:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:58,916 INFO L225 Difference]: With dead ends: 1568 [2018-11-23 02:00:58,917 INFO L226 Difference]: Without dead ends: 851 [2018-11-23 02:00:58,918 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-23 02:00:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-23 02:00:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2018-11-23 02:00:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-11-23 02:00:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1165 transitions. [2018-11-23 02:00:58,983 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1165 transitions. Word has length 90 [2018-11-23 02:00:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:58,983 INFO L480 AbstractCegarLoop]: Abstraction has 851 states and 1165 transitions. [2018-11-23 02:00:58,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:00:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1165 transitions. [2018-11-23 02:00:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:00:58,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:58,984 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] [2018-11-23 02:00:58,984 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:58,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:58,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1663428051, now seen corresponding path program 1 times [2018-11-23 02:00:58,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:00:58,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:00:58,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:58,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:58,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:00:59,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:59,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:00:59,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:00:59,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:00:59,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:00:59,148 INFO L87 Difference]: Start difference. First operand 851 states and 1165 transitions. Second operand 9 states. [2018-11-23 02:01:02,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:02,902 INFO L93 Difference]: Finished difference Result 927 states and 1245 transitions. [2018-11-23 02:01:02,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:01:02,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-11-23 02:01:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:02,904 INFO L225 Difference]: With dead ends: 927 [2018-11-23 02:01:02,904 INFO L226 Difference]: Without dead ends: 880 [2018-11-23 02:01:02,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:01:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2018-11-23 02:01:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 856. [2018-11-23 02:01:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-23 02:01:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1170 transitions. [2018-11-23 02:01:02,986 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1170 transitions. Word has length 91 [2018-11-23 02:01:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:02,987 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 1170 transitions. [2018-11-23 02:01:02,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:01:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1170 transitions. [2018-11-23 02:01:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:01:02,987 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:02,988 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] [2018-11-23 02:01:02,988 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:02,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:02,988 INFO L82 PathProgramCache]: Analyzing trace with hash -693847028, now seen corresponding path program 1 times [2018-11-23 02:01:02,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:02,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:02,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:02,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:01:03,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:03,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 02:01:03,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 02:01:03,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:01:03,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:01:03,176 INFO L87 Difference]: Start difference. First operand 856 states and 1170 transitions. Second operand 11 states. [2018-11-23 02:01:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:05,360 INFO L93 Difference]: Finished difference Result 881 states and 1196 transitions. [2018-11-23 02:01:05,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:01:05,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-23 02:01:05,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:05,361 INFO L225 Difference]: With dead ends: 881 [2018-11-23 02:01:05,362 INFO L226 Difference]: Without dead ends: 842 [2018-11-23 02:01:05,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:01:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-11-23 02:01:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 837. [2018-11-23 02:01:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-11-23 02:01:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1145 transitions. [2018-11-23 02:01:05,439 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1145 transitions. Word has length 91 [2018-11-23 02:01:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:05,439 INFO L480 AbstractCegarLoop]: Abstraction has 837 states and 1145 transitions. [2018-11-23 02:01:05,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 02:01:05,439 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1145 transitions. [2018-11-23 02:01:05,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:01:05,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:05,440 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] [2018-11-23 02:01:05,440 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:05,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:05,440 INFO L82 PathProgramCache]: Analyzing trace with hash -938732443, now seen corresponding path program 1 times [2018-11-23 02:01:05,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:05,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:05,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:05,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:05,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:05,528 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-23 02:01:05,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:05,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/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-23 02:01:05,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:05,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:05,736 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-23 02:01:05,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:01:05,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 02:01:05,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:01:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:01:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:01:05,754 INFO L87 Difference]: Start difference. First operand 837 states and 1145 transitions. Second operand 6 states. [2018-11-23 02:01:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:05,942 INFO L93 Difference]: Finished difference Result 1555 states and 2154 transitions. [2018-11-23 02:01:05,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:01:05,942 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-11-23 02:01:05,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:05,944 INFO L225 Difference]: With dead ends: 1555 [2018-11-23 02:01:05,944 INFO L226 Difference]: Without dead ends: 838 [2018-11-23 02:01:05,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:01:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-23 02:01:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2018-11-23 02:01:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-23 02:01:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1146 transitions. [2018-11-23 02:01:06,038 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1146 transitions. Word has length 91 [2018-11-23 02:01:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:06,038 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1146 transitions. [2018-11-23 02:01:06,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:01:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1146 transitions. [2018-11-23 02:01:06,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 02:01:06,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:06,039 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] [2018-11-23 02:01:06,039 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:06,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:06,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1641370031, now seen corresponding path program 2 times [2018-11-23 02:01:06,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:06,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:06,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:06,150 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-23 02:01:06,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:06,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/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-23 02:01:06,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:01:06,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 02:01:06,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:01:06,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:06,398 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-23 02:01:06,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:01:06,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-23 02:01:06,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:01:06,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:01:06,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:06,416 INFO L87 Difference]: Start difference. First operand 838 states and 1146 transitions. Second operand 9 states. [2018-11-23 02:01:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:07,691 INFO L93 Difference]: Finished difference Result 1372 states and 1879 transitions. [2018-11-23 02:01:07,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 02:01:07,691 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2018-11-23 02:01:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:07,692 INFO L225 Difference]: With dead ends: 1372 [2018-11-23 02:01:07,692 INFO L226 Difference]: Without dead ends: 653 [2018-11-23 02:01:07,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:01:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-23 02:01:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 466. [2018-11-23 02:01:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-11-23 02:01:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 592 transitions. [2018-11-23 02:01:07,737 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 592 transitions. Word has length 92 [2018-11-23 02:01:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:07,737 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 592 transitions. [2018-11-23 02:01:07,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:01:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 592 transitions. [2018-11-23 02:01:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-23 02:01:07,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:07,738 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:07,738 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:07,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:07,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1812324177, now seen corresponding path program 1 times [2018-11-23 02:01:07,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:07,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:07,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:07,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:01:07,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 02:01:07,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:07,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/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-23 02:01:07,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:08,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:01:08,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:01:08,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-11-23 02:01:08,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 02:01:08,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:01:08,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:01:08,104 INFO L87 Difference]: Start difference. First operand 466 states and 592 transitions. Second operand 12 states. [2018-11-23 02:01:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:10,319 INFO L93 Difference]: Finished difference Result 723 states and 937 transitions. [2018-11-23 02:01:10,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:01:10,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2018-11-23 02:01:10,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:10,322 INFO L225 Difference]: With dead ends: 723 [2018-11-23 02:01:10,322 INFO L226 Difference]: Without dead ends: 476 [2018-11-23 02:01:10,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:01:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-11-23 02:01:10,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 468. [2018-11-23 02:01:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-11-23 02:01:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 593 transitions. [2018-11-23 02:01:10,355 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 593 transitions. Word has length 100 [2018-11-23 02:01:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:10,355 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 593 transitions. [2018-11-23 02:01:10,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 02:01:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 593 transitions. [2018-11-23 02:01:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 02:01:10,356 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:10,356 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-11-23 02:01:10,356 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:10,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:10,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1537605920, now seen corresponding path program 1 times [2018-11-23 02:01:10,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:10,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:10,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:10,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:10,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 02:01:10,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:10,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/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-23 02:01:10,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:10,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 02:01:10,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:01:10,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-23 02:01:10,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:01:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:01:10,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:10,634 INFO L87 Difference]: Start difference. First operand 468 states and 593 transitions. Second operand 9 states. [2018-11-23 02:01:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:12,716 INFO L93 Difference]: Finished difference Result 692 states and 901 transitions. [2018-11-23 02:01:12,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:01:12,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-11-23 02:01:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:12,717 INFO L225 Difference]: With dead ends: 692 [2018-11-23 02:01:12,717 INFO L226 Difference]: Without dead ends: 406 [2018-11-23 02:01:12,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:01:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-11-23 02:01:12,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2018-11-23 02:01:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-11-23 02:01:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 526 transitions. [2018-11-23 02:01:12,746 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 526 transitions. Word has length 102 [2018-11-23 02:01:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:12,746 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 526 transitions. [2018-11-23 02:01:12,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:01:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 526 transitions. [2018-11-23 02:01:12,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 02:01:12,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:12,747 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-23 02:01:12,747 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:12,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:12,748 INFO L82 PathProgramCache]: Analyzing trace with hash -967409040, now seen corresponding path program 1 times [2018-11-23 02:01:12,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:12,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:12,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:12,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:12,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:01:12,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:12,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:01:12,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:01:12,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:01:12,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:01:12,877 INFO L87 Difference]: Start difference. First operand 406 states and 526 transitions. Second operand 8 states. [2018-11-23 02:01:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:13,563 INFO L93 Difference]: Finished difference Result 732 states and 955 transitions. [2018-11-23 02:01:13,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:01:13,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2018-11-23 02:01:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:13,564 INFO L225 Difference]: With dead ends: 732 [2018-11-23 02:01:13,564 INFO L226 Difference]: Without dead ends: 396 [2018-11-23 02:01:13,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:01:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-23 02:01:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2018-11-23 02:01:13,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-23 02:01:13,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 508 transitions. [2018-11-23 02:01:13,594 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 508 transitions. Word has length 108 [2018-11-23 02:01:13,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:13,594 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 508 transitions. [2018-11-23 02:01:13,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:01:13,594 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 508 transitions. [2018-11-23 02:01:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 02:01:13,594 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:13,594 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, 1] [2018-11-23 02:01:13,595 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:13,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash 52384797, now seen corresponding path program 1 times [2018-11-23 02:01:13,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:01:13,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:01:13,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:13,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:13,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:01:13,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:13,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 02:01:13,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 02:01:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:01:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:01:13,817 INFO L87 Difference]: Start difference. First operand 396 states and 508 transitions. Second operand 14 states. [2018-11-23 02:02:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:44,239 INFO L93 Difference]: Finished difference Result 834 states and 1060 transitions. [2018-11-23 02:02:44,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 02:02:44,240 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-23 02:02:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:44,241 INFO L225 Difference]: With dead ends: 834 [2018-11-23 02:02:44,241 INFO L226 Difference]: Without dead ends: 586 [2018-11-23 02:02:44,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=913, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 02:02:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-11-23 02:02:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 532. [2018-11-23 02:02:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-23 02:02:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 659 transitions. [2018-11-23 02:02:44,278 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 659 transitions. Word has length 109 [2018-11-23 02:02:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:44,278 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 659 transitions. [2018-11-23 02:02:44,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 02:02:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 659 transitions. [2018-11-23 02:02:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-23 02:02:44,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:44,279 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, 1] [2018-11-23 02:02:44,279 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:44,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1854018469, now seen corresponding path program 1 times [2018-11-23 02:02:44,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:02:44,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:02:44,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:44,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:44,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:02:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:02:44,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:02:44,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 02:02:44,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 02:02:44,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:02:44,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:02:44,404 INFO L87 Difference]: Start difference. First operand 532 states and 659 transitions. Second operand 10 states. [2018-11-23 02:03:31,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:03:31,556 INFO L93 Difference]: Finished difference Result 595 states and 723 transitions. [2018-11-23 02:03:31,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 02:03:31,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2018-11-23 02:03:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:03:31,557 INFO L225 Difference]: With dead ends: 595 [2018-11-23 02:03:31,557 INFO L226 Difference]: Without dead ends: 569 [2018-11-23 02:03:31,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:03:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-11-23 02:03:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 532. [2018-11-23 02:03:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-23 02:03:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 658 transitions. [2018-11-23 02:03:31,597 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 658 transitions. Word has length 109 [2018-11-23 02:03:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:03:31,598 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 658 transitions. [2018-11-23 02:03:31,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 02:03:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 658 transitions. [2018-11-23 02:03:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-23 02:03:31,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:03:31,598 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:03:31,598 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:03:31,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:03:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1341841926, now seen corresponding path program 1 times [2018-11-23 02:03:31,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:03:31,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:03:31,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:03:31,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:03:31,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:03:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:03:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 02:03:31,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:03:31,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:03:31,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:03:31,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:03:31,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:03:31,748 INFO L87 Difference]: Start difference. First operand 532 states and 658 transitions. Second operand 9 states. [2018-11-23 02:04:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:04:22,215 INFO L93 Difference]: Finished difference Result 594 states and 720 transitions. [2018-11-23 02:04:22,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 02:04:22,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2018-11-23 02:04:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:04:22,216 INFO L225 Difference]: With dead ends: 594 [2018-11-23 02:04:22,216 INFO L226 Difference]: Without dead ends: 560 [2018-11-23 02:04:22,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:04:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-11-23 02:04:22,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 530. [2018-11-23 02:04:22,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-11-23 02:04:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 652 transitions. [2018-11-23 02:04:22,254 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 652 transitions. Word has length 124 [2018-11-23 02:04:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:04:22,254 INFO L480 AbstractCegarLoop]: Abstraction has 530 states and 652 transitions. [2018-11-23 02:04:22,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:04:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 652 transitions. [2018-11-23 02:04:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-23 02:04:22,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:04:22,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:04:22,255 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:04:22,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:04:22,255 INFO L82 PathProgramCache]: Analyzing trace with hash 961664768, now seen corresponding path program 1 times [2018-11-23 02:04:22,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:04:22,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:04:22,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:04:22,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:04:22,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:04:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:04:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:04:22,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:04:22,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:04:22,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:04:22,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:04:22,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:04:22,347 INFO L87 Difference]: Start difference. First operand 530 states and 652 transitions. Second operand 5 states. [2018-11-23 02:04:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:04:22,431 INFO L93 Difference]: Finished difference Result 562 states and 686 transitions. [2018-11-23 02:04:22,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:04:22,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-11-23 02:04:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:04:22,433 INFO L225 Difference]: With dead ends: 562 [2018-11-23 02:04:22,433 INFO L226 Difference]: Without dead ends: 536 [2018-11-23 02:04:22,433 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-23 02:04:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-23 02:04:22,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 534. [2018-11-23 02:04:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-11-23 02:04:22,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 656 transitions. [2018-11-23 02:04:22,472 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 656 transitions. Word has length 118 [2018-11-23 02:04:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:04:22,472 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 656 transitions. [2018-11-23 02:04:22,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:04:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 656 transitions. [2018-11-23 02:04:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 02:04:22,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:04:22,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:04:22,473 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:04:22,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:04:22,474 INFO L82 PathProgramCache]: Analyzing trace with hash 145709530, now seen corresponding path program 1 times [2018-11-23 02:04:22,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:04:22,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:04:22,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:04:22,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:04:22,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:04:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:04:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:04:22,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:04:22,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:04:22,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:04:22,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:04:22,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:04:22,597 INFO L87 Difference]: Start difference. First operand 534 states and 656 transitions. Second operand 9 states. [2018-11-23 02:04:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:04:22,714 INFO L93 Difference]: Finished difference Result 569 states and 694 transitions. [2018-11-23 02:04:22,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:04:22,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2018-11-23 02:04:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:04:22,715 INFO L225 Difference]: With dead ends: 569 [2018-11-23 02:04:22,715 INFO L226 Difference]: Without dead ends: 333 [2018-11-23 02:04:22,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-23 02:04:22,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-23 02:04:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 162. [2018-11-23 02:04:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 02:04:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2018-11-23 02:04:22,731 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 119 [2018-11-23 02:04:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:04:22,731 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2018-11-23 02:04:22,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:04:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2018-11-23 02:04:22,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 02:04:22,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:04:22,731 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 02:04:22,732 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:04:22,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:04:22,732 INFO L82 PathProgramCache]: Analyzing trace with hash -867248141, now seen corresponding path program 1 times [2018-11-23 02:04:22,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:04:22,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:04:22,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:04:22,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:04:22,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:04:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:04:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 02:04:22,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:04:22,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 02:04:22,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:04:22,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:04:22,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:04:22,871 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand 9 states. [2018-11-23 02:05:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:05:07,831 INFO L93 Difference]: Finished difference Result 312 states and 339 transitions. [2018-11-23 02:05:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 02:05:07,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-11-23 02:05:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:05:07,832 INFO L225 Difference]: With dead ends: 312 [2018-11-23 02:05:07,832 INFO L226 Difference]: Without dead ends: 162 [2018-11-23 02:05:07,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:05:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-23 02:05:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-11-23 02:05:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 02:05:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2018-11-23 02:05:07,846 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 131 [2018-11-23 02:05:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:05:07,846 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2018-11-23 02:05:07,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:05:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2018-11-23 02:05:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 02:05:07,847 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:05:07,847 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2018-11-23 02:05:07,847 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:05:07,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:05:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1959883343, now seen corresponding path program 1 times [2018-11-23 02:05:07,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:05:07,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:05:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:07,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:05:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:05:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:05:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 02:05:08,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:05:08,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 02:05:08,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 02:05:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:05:08,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:05:08,011 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand 12 states. [2018-11-23 02:05:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:05:41,899 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2018-11-23 02:05:41,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 02:05:41,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 131 [2018-11-23 02:05:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:05:41,900 INFO L225 Difference]: With dead ends: 168 [2018-11-23 02:05:41,900 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:05:41,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-11-23 02:05:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:05:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:05:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:05:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:05:41,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 131 [2018-11-23 02:05:41,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:05:41,901 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:05:41,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 02:05:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:05:41,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:05:41,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:05:41,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:41,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:41,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,699 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:42,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:43,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:44,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 02:05:45,357 WARN L180 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 92 [2018-11-23 02:05:45,581 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:45,768 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2018-11-23 02:05:45,989 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:46,499 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 70 [2018-11-23 02:05:46,652 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:05:47,183 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 81 [2018-11-23 02:05:47,291 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2018-11-23 02:05:47,513 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2018-11-23 02:05:48,307 WARN L180 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 82 [2018-11-23 02:05:48,441 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-11-23 02:05:48,590 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-11-23 02:05:49,007 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 88 [2018-11-23 02:05:49,129 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 1 [2018-11-23 02:05:49,365 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:49,470 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:05:49,863 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2018-11-23 02:05:50,171 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2018-11-23 02:05:50,370 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-11-23 02:05:50,917 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 76 [2018-11-23 02:05:51,165 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 67 [2018-11-23 02:05:51,510 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2018-11-23 02:05:51,749 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2018-11-23 02:05:51,904 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2018-11-23 02:05:52,333 WARN L180 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 76 [2018-11-23 02:05:52,478 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2018-11-23 02:05:52,727 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:53,048 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2018-11-23 02:05:53,510 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 78 [2018-11-23 02:05:53,616 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2018-11-23 02:05:53,746 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-11-23 02:05:53,962 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2018-11-23 02:05:54,085 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 75 [2018-11-23 02:05:54,789 WARN L180 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 81 [2018-11-23 02:05:55,007 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:55,225 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 1 [2018-11-23 02:05:55,444 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:55,680 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:56,060 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:56,164 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2018-11-23 02:05:56,298 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-11-23 02:05:56,791 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 62 [2018-11-23 02:05:56,896 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2018-11-23 02:05:57,114 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 1 [2018-11-23 02:05:57,229 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-11-23 02:05:57,414 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2018-11-23 02:05:57,519 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:05:57,915 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 74 [2018-11-23 02:05:58,133 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:58,353 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:58,781 WARN L180 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 78 [2018-11-23 02:05:59,245 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 93 [2018-11-23 02:05:59,401 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 1 [2018-11-23 02:05:59,621 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:05:59,855 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:00,081 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 74 [2018-11-23 02:06:00,310 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 1 [2018-11-23 02:06:00,416 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2018-11-23 02:06:00,522 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2018-11-23 02:06:00,627 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:06:00,863 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2018-11-23 02:06:00,970 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2018-11-23 02:06:01,135 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:06:01,786 WARN L180 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 93 [2018-11-23 02:06:02,564 WARN L180 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 78 [2018-11-23 02:06:02,752 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2018-11-23 02:06:02,983 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:03,280 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 78 [2018-11-23 02:06:03,383 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2018-11-23 02:06:04,198 WARN L180 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 86 [2018-11-23 02:06:04,454 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:04,653 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 57 [2018-11-23 02:06:04,835 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2018-11-23 02:06:05,027 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2018-11-23 02:06:05,190 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:06:05,420 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 1 [2018-11-23 02:06:05,528 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2018-11-23 02:06:05,748 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:05,911 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 1 [2018-11-23 02:06:06,068 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2018-11-23 02:06:06,296 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2018-11-23 02:06:06,490 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2018-11-23 02:06:06,709 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:07,084 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2018-11-23 02:06:07,273 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2018-11-23 02:06:07,561 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2018-11-23 02:06:07,777 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 1 [2018-11-23 02:06:08,334 WARN L180 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2018-11-23 02:06:09,497 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 188 DAG size of output: 93 [2018-11-23 02:06:09,739 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2018-11-23 02:06:09,893 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2018-11-23 02:06:10,068 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 1 [2018-11-23 02:06:10,174 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-11-23 02:06:10,337 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:06:10,601 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2018-11-23 02:06:10,705 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-11-23 02:06:11,137 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 78 [2018-11-23 02:06:11,251 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-11-23 02:06:11,357 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:06:11,677 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2018-11-23 02:06:12,360 WARN L180 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 74 [2018-11-23 02:06:12,575 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2018-11-23 02:06:12,964 WARN L180 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 58 [2018-11-23 02:06:14,022 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 174 DAG size of output: 94 [2018-11-23 02:06:14,208 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2018-11-23 02:06:14,312 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 46 [2018-11-23 02:06:14,504 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2018-11-23 02:06:14,611 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-11-23 02:06:14,837 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:14,947 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2018-11-23 02:06:15,057 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2018-11-23 02:06:15,419 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 65 [2018-11-23 02:06:15,538 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-11-23 02:06:16,654 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 187 DAG size of output: 86 [2018-11-23 02:06:16,831 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 57 [2018-11-23 02:06:17,019 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2018-11-23 02:06:17,203 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2018-11-23 02:06:17,366 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-11-23 02:06:17,479 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2018-11-23 02:06:17,677 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2018-11-23 02:06:17,915 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:18,023 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-11-23 02:06:18,277 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2018-11-23 02:06:19,074 WARN L180 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 82 [2018-11-23 02:06:19,308 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2018-11-23 02:06:19,471 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-11-23 02:06:19,944 WARN L180 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 93 [2018-11-23 02:06:20,169 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:20,806 WARN L180 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 83 [2018-11-23 02:06:20,972 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:06:21,196 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2018-11-23 02:06:21,468 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2018-11-23 02:06:21,698 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2018-11-23 02:06:21,881 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-11-23 02:06:22,109 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:22,219 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2018-11-23 02:06:22,327 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2018-11-23 02:06:22,444 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-11-23 02:06:22,565 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 71 [2018-11-23 02:06:22,676 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 52 [2018-11-23 02:06:23,894 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 188 DAG size of output: 93 [2018-11-23 02:06:24,071 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2018-11-23 02:06:24,183 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2018-11-23 02:06:24,343 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2018-11-23 02:06:24,571 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:24,744 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2018-11-23 02:06:24,958 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 84 [2018-11-23 02:06:25,133 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 1 [2018-11-23 02:06:25,420 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:26,253 WARN L180 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 86 [2018-11-23 02:06:26,492 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2018-11-23 02:06:26,629 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-11-23 02:06:26,897 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 67 [2018-11-23 02:06:27,006 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:06:27,182 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 1 [2018-11-23 02:06:27,318 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-11-23 02:06:27,550 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2018-11-23 02:06:27,717 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:06:27,882 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:06:27,991 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2018-11-23 02:06:28,338 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 82 [2018-11-23 02:06:28,533 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2018-11-23 02:06:28,643 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 45 [2018-11-23 02:06:28,873 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:29,104 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:29,243 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2018-11-23 02:06:30,103 WARN L180 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 86 [2018-11-23 02:06:30,394 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 75 [2018-11-23 02:06:30,543 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-11-23 02:06:30,773 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2018-11-23 02:06:31,231 WARN L180 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 74 [2018-11-23 02:06:31,340 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 52 [2018-11-23 02:06:31,520 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2018-11-23 02:06:31,802 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 1 [2018-11-23 02:06:32,032 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:32,197 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 52 [2018-11-23 02:06:32,427 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:32,581 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-11-23 02:06:32,770 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2018-11-23 02:06:32,886 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 52 [2018-11-23 02:06:33,124 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2018-11-23 02:06:33,240 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 57 [2018-11-23 02:06:33,450 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2018-11-23 02:06:33,453 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousEXIT(lines 2922 2964) no Hoare annotation was computed. [2018-11-23 02:06:33,453 INFO L448 ceAbstractionStarter]: For program point L2935(lines 2935 2945) no Hoare annotation was computed. [2018-11-23 02:06:33,454 INFO L444 ceAbstractionStarter]: At program point SendSrbSynchronousENTRY(lines 2922 2964) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse8 (< 3 ~SKIP1~0)) (.cse1 (< 2 ~DC~0)) (.cse2 (not (= ~SKIP2~0 4))) (.cse3 (= 1 ~pended~0)) (.cse9 (< ~SKIP1~0 3)) (.cse5 (not (= ~myIrp_PendingReturned~0 0))) (.cse6 (not (= 1 ~NP~0))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= 1 ~MPR3~0))) (and (or (and (= 0 ~customIrp~0) (= |old(~s~0)| ~s~0)) (not (= ~myStatus~0 0)) (or .cse0 .cse1 .cse2 .cse3 (= 7 ~MPR3~0) .cse4 (not (= ~compRegistered~0 1)) (or .cse5 .cse6 .cse7 .cse8 (not (= ~compRegistered~0 ~routine~0)) .cse9 .cse10)) (not (= |old(~customIrp~0)| 0))) (or .cse0 .cse8 .cse1 .cse2 .cse3 .cse9 (= ~NP~0 ~s~0) .cse5 .cse6 (not (= 0 ~routine~0)) .cse7 .cse4 (not (= ~compRegistered~0 0)) .cse10))) [2018-11-23 02:06:33,454 INFO L448 ceAbstractionStarter]: For program point L2935-2(lines 2930 2963) no Hoare annotation was computed. [2018-11-23 02:06:33,454 INFO L444 ceAbstractionStarter]: At program point L2956(line 2956) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 ~pended~0)) (.cse13 (= 7 ~MPR3~0)) (.cse5 (< ~SKIP1~0 3)) (.cse6 (not (= ~myIrp_PendingReturned~0 0))) (.cse7 (not (= 1 ~NP~0))) (.cse8 (not (= 0 ~routine~0))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (not (= ~compRegistered~0 0))) (.cse12 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~NP~0 ~s~0) .cse12) (or (not (= ~myStatus~0 0)) (or .cse0 .cse2 .cse3 .cse4 .cse13 .cse10 (not (= ~compRegistered~0 1)) (or .cse6 .cse7 .cse9 .cse1 (not (= ~compRegistered~0 ~routine~0)) .cse5 .cse12)) (not (= |old(~customIrp~0)| 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-11-23 02:06:33,454 INFO L448 ceAbstractionStarter]: For program point L2954(lines 2954 2961) no Hoare annotation was computed. [2018-11-23 02:06:33,454 INFO L448 ceAbstractionStarter]: For program point L2956-1(line 2956) no Hoare annotation was computed. [2018-11-23 02:06:33,454 INFO L448 ceAbstractionStarter]: For program point L2954-2(lines 2954 2961) no Hoare annotation was computed. [2018-11-23 02:06:33,454 INFO L448 ceAbstractionStarter]: For program point SendSrbSynchronousFINAL(lines 2922 2964) no Hoare annotation was computed. [2018-11-23 02:06:33,454 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 2866 2887) no Hoare annotation was computed. [2018-11-23 02:06:33,455 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 2866 2887) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (= 1 |old(~pended~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 (= ~myIrp_PendingReturned~0 0)) (and (= ~s~0 ~UNLOADED~0) (= 0 ~customIrp~0) (= ~DC~0 ~s~0) (= ~NP~0 ~s~0) (= ~compRegistered~0 ~routine~0) (= ~SKIP1~0 ~s~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~MPR3~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,455 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 2866 2887) no Hoare annotation was computed. [2018-11-23 02:06:33,455 INFO L444 ceAbstractionStarter]: At program point L3520(lines 3489 3558) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,455 INFO L448 ceAbstractionStarter]: For program point L3586-1(line 3586) no Hoare annotation was computed. [2018-11-23 02:06:33,455 INFO L448 ceAbstractionStarter]: For program point L3388(lines 3388 3402) no Hoare annotation was computed. [2018-11-23 02:06:33,455 INFO L448 ceAbstractionStarter]: For program point L3603-1(line 3603) no Hoare annotation was computed. [2018-11-23 02:06:33,456 INFO L444 ceAbstractionStarter]: At program point L3603(line 3603) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,456 INFO L444 ceAbstractionStarter]: At program point L3372(line 3372) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,456 INFO L448 ceAbstractionStarter]: For program point L3372-1(line 3372) no Hoare annotation was computed. [2018-11-23 02:06:33,456 INFO L448 ceAbstractionStarter]: For program point L3240(line 3240) no Hoare annotation was computed. [2018-11-23 02:06:33,456 INFO L448 ceAbstractionStarter]: For program point L3521-1(lines 3486 3559) no Hoare annotation was computed. [2018-11-23 02:06:33,456 INFO L448 ceAbstractionStarter]: For program point L3521(lines 3521 3557) no Hoare annotation was computed. [2018-11-23 02:06:33,456 INFO L448 ceAbstractionStarter]: For program point L3340(lines 3340 3416) no Hoare annotation was computed. [2018-11-23 02:06:33,456 INFO L448 ceAbstractionStarter]: For program point L3307-1(line 3307) no Hoare annotation was computed. [2018-11-23 02:06:33,457 INFO L444 ceAbstractionStarter]: At program point L3307(line 3307) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,457 INFO L448 ceAbstractionStarter]: For program point L3241-1(line 3241) no Hoare annotation was computed. [2018-11-23 02:06:33,457 INFO L444 ceAbstractionStarter]: At program point L3241(line 3241) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,457 INFO L448 ceAbstractionStarter]: For program point L3588(lines 3588 3592) no Hoare annotation was computed. [2018-11-23 02:06:33,457 INFO L448 ceAbstractionStarter]: For program point L3522(lines 3522 3554) no Hoare annotation was computed. [2018-11-23 02:06:33,457 INFO L448 ceAbstractionStarter]: For program point L3489(lines 3489 3558) no Hoare annotation was computed. [2018-11-23 02:06:33,457 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceEXIT(lines 3166 3607) no Hoare annotation was computed. [2018-11-23 02:06:33,457 INFO L444 ceAbstractionStarter]: At program point L3390(line 3390) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,457 INFO L448 ceAbstractionStarter]: For program point L3390-1(line 3390) no Hoare annotation was computed. [2018-11-23 02:06:33,457 INFO L444 ceAbstractionStarter]: At program point L3440(line 3440) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,458 INFO L448 ceAbstractionStarter]: For program point L3473(lines 3473 3481) no Hoare annotation was computed. [2018-11-23 02:06:33,458 INFO L448 ceAbstractionStarter]: For program point L3440-1(line 3440) no Hoare annotation was computed. [2018-11-23 02:06:33,458 INFO L448 ceAbstractionStarter]: For program point L3490(lines 3490 3518) no Hoare annotation was computed. [2018-11-23 02:06:33,458 INFO L448 ceAbstractionStarter]: For program point L3523(lines 3523 3551) no Hoare annotation was computed. [2018-11-23 02:06:33,458 INFO L444 ceAbstractionStarter]: At program point L3292(line 3292) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,458 INFO L448 ceAbstractionStarter]: For program point L3292-1(line 3292) no Hoare annotation was computed. [2018-11-23 02:06:33,458 INFO L444 ceAbstractionStarter]: At program point L3226-2(lines 3226 3248) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,458 INFO L448 ceAbstractionStarter]: For program point L3573-1(line 3573) no Hoare annotation was computed. [2018-11-23 02:06:33,458 INFO L444 ceAbstractionStarter]: At program point L3573(line 3573) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,458 INFO L444 ceAbstractionStarter]: At program point L3474(lines 3448 3482) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,458 INFO L448 ceAbstractionStarter]: For program point L3210(lines 3210 3583) no Hoare annotation was computed. [2018-11-23 02:06:33,458 INFO L448 ceAbstractionStarter]: For program point L3210-1(lines 3210 3583) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3524(lines 3524 3548) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3491(lines 3491 3515) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3227(lines 3226 3248) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3376(lines 3376 3404) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3343-1(lines 3343 3362) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3343(lines 3343 3362) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3492(lines 3492 3512) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3525(lines 3525 3545) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3426(lines 3426 3443) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3459(lines 3459 3467) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3426-1(lines 3420 3444) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3344(lines 3344 3359) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3526(lines 3526 3542) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3493(lines 3493 3509) no Hoare annotation was computed. [2018-11-23 02:06:33,459 INFO L444 ceAbstractionStarter]: At program point CdAudioStartDeviceENTRY(lines 3166 3607) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= ~routine~0 0) (= |old(~s~0)| ~s~0) (not (= ~pended~0 1))) (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637))) .cse13))) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,459 INFO L448 ceAbstractionStarter]: For program point L3394(lines 3394 3401) no Hoare annotation was computed. [2018-11-23 02:06:33,460 INFO L444 ceAbstractionStarter]: At program point L3196(line 3196) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= 0 ~customIrp~0) (= ~routine~0 0) (= |old(~s~0)| ~s~0) (not (= ~pended~0 1))) (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637))) .cse13))) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,460 INFO L448 ceAbstractionStarter]: For program point L3196-1(line 3196) no Hoare annotation was computed. [2018-11-23 02:06:33,460 INFO L448 ceAbstractionStarter]: For program point L3477-1(line 3477) no Hoare annotation was computed. [2018-11-23 02:06:33,460 INFO L444 ceAbstractionStarter]: At program point L3477(line 3477) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,460 INFO L444 ceAbstractionStarter]: At program point L3378(line 3378) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,460 INFO L448 ceAbstractionStarter]: For program point L3345(lines 3345 3356) no Hoare annotation was computed. [2018-11-23 02:06:33,460 INFO L448 ceAbstractionStarter]: For program point L3378-1(line 3378) no Hoare annotation was computed. [2018-11-23 02:06:33,460 INFO L444 ceAbstractionStarter]: At program point L3246(line 3246) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,460 INFO L448 ceAbstractionStarter]: For program point L3246-1(line 3246) no Hoare annotation was computed. [2018-11-23 02:06:33,461 INFO L448 ceAbstractionStarter]: For program point L3494(lines 3494 3506) no Hoare annotation was computed. [2018-11-23 02:06:33,461 INFO L448 ceAbstractionStarter]: For program point L3346(lines 3346 3353) no Hoare annotation was computed. [2018-11-23 02:06:33,461 INFO L444 ceAbstractionStarter]: At program point L3594(lines 3594 3595) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or (and (and (= ~compRegistered~0 ~routine~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (not (= ~pended~0 1))) (= 0 ~customIrp~0)) .cse1 .cse2)))) [2018-11-23 02:06:33,461 INFO L444 ceAbstractionStarter]: At program point L3528(line 3528) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,461 INFO L448 ceAbstractionStarter]: For program point L3594-1(lines 3594 3595) no Hoare annotation was computed. [2018-11-23 02:06:33,461 INFO L448 ceAbstractionStarter]: For program point L3495(lines 3495 3503) no Hoare annotation was computed. [2018-11-23 02:06:33,461 INFO L448 ceAbstractionStarter]: For program point L3528-1(line 3528) no Hoare annotation was computed. [2018-11-23 02:06:33,462 INFO L444 ceAbstractionStarter]: At program point L3396(line 3396) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,463 INFO L448 ceAbstractionStarter]: For program point L3363-1(lines 3340 3416) no Hoare annotation was computed. [2018-11-23 02:06:33,463 INFO L448 ceAbstractionStarter]: For program point L3363(lines 3363 3415) no Hoare annotation was computed. [2018-11-23 02:06:33,463 INFO L448 ceAbstractionStarter]: For program point L3396-1(line 3396) no Hoare annotation was computed. [2018-11-23 02:06:33,463 INFO L448 ceAbstractionStarter]: For program point L3264(lines 3264 3278) no Hoare annotation was computed. [2018-11-23 02:06:33,463 INFO L448 ceAbstractionStarter]: For program point L3297-1(lines 3297 3336) no Hoare annotation was computed. [2018-11-23 02:06:33,463 INFO L448 ceAbstractionStarter]: For program point L3297(lines 3297 3336) no Hoare annotation was computed. [2018-11-23 02:06:33,463 INFO L448 ceAbstractionStarter]: For program point L3198(lines 3198 3202) no Hoare annotation was computed. [2018-11-23 02:06:33,463 INFO L444 ceAbstractionStarter]: At program point L3231-1(lines 3228 3238) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,463 INFO L448 ceAbstractionStarter]: For program point L3231(lines 3231 3235) no Hoare annotation was computed. [2018-11-23 02:06:33,463 INFO L448 ceAbstractionStarter]: For program point L3215-1(line 3215) no Hoare annotation was computed. [2018-11-23 02:06:33,464 INFO L444 ceAbstractionStarter]: At program point L3215(line 3215) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or (and (= ~myStatus~0 CdAudioStartDevice_~status~2) (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse1 .cse2)))) [2018-11-23 02:06:33,464 INFO L448 ceAbstractionStarter]: For program point L3430(lines 3430 3437) no Hoare annotation was computed. [2018-11-23 02:06:33,464 INFO L448 ceAbstractionStarter]: For program point L3463-1(line 3463) no Hoare annotation was computed. [2018-11-23 02:06:33,464 INFO L444 ceAbstractionStarter]: At program point L3463(line 3463) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,464 INFO L448 ceAbstractionStarter]: For program point L3364(lines 3364 3412) no Hoare annotation was computed. [2018-11-23 02:06:33,464 INFO L448 ceAbstractionStarter]: For program point L3298(lines 3298 3333) no Hoare annotation was computed. [2018-11-23 02:06:33,464 INFO L444 ceAbstractionStarter]: At program point L3348(line 3348) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3282(lines 3282 3296) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3348-1(line 3348) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L444 ceAbstractionStarter]: At program point L3249(lines 3210 3581) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3563(lines 3563 3577) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3497-1(line 3497) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L444 ceAbstractionStarter]: At program point L3497(line 3497) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3365(lines 3365 3409) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3299(lines 3299 3330) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3448(lines 3448 3482) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3382(lines 3382 3403) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3448-1(lines 3448 3482) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3597(lines 3597 3601) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3597-2(lines 3597 3601) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3300(lines 3300 3327) no Hoare annotation was computed. [2018-11-23 02:06:33,465 INFO L448 ceAbstractionStarter]: For program point L3218(lines 3218 3223) no Hoare annotation was computed. [2018-11-23 02:06:33,466 INFO L444 ceAbstractionStarter]: At program point L3268(line 3268) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,466 INFO L448 ceAbstractionStarter]: For program point L3301(lines 3301 3324) no Hoare annotation was computed. [2018-11-23 02:06:33,466 INFO L448 ceAbstractionStarter]: For program point L3268-1(line 3268) no Hoare annotation was computed. [2018-11-23 02:06:33,466 INFO L444 ceAbstractionStarter]: At program point L3384(line 3384) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,466 INFO L448 ceAbstractionStarter]: For program point L3384-1(line 3384) no Hoare annotation was computed. [2018-11-23 02:06:33,466 INFO L448 ceAbstractionStarter]: For program point L3533(lines 3533 3541) no Hoare annotation was computed. [2018-11-23 02:06:33,466 INFO L444 ceAbstractionStarter]: At program point L3434(line 3434) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,466 INFO L448 ceAbstractionStarter]: For program point L3368(lines 3368 3408) no Hoare annotation was computed. [2018-11-23 02:06:33,466 INFO L448 ceAbstractionStarter]: For program point L3434-1(line 3434) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point L3302(lines 3302 3321) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point CdAudioStartDeviceFINAL(lines 3166 3607) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L444 ceAbstractionStarter]: At program point L3369(lines 3365 3409) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point L3270(lines 3270 3277) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point L3303(lines 3303 3318) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point L3270-2(lines 3264 3278) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point L3535-1(line 3535) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L444 ceAbstractionStarter]: At program point L3535(line 3535) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point L3370(lines 3370 3405) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point L3304(lines 3304 3315) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point L3486(lines 3486 3559) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point L3420(lines 3420 3444) no Hoare annotation was computed. [2018-11-23 02:06:33,467 INFO L448 ceAbstractionStarter]: For program point L3453(lines 3453 3468) no Hoare annotation was computed. [2018-11-23 02:06:33,468 INFO L448 ceAbstractionStarter]: For program point L3288(lines 3288 3295) no Hoare annotation was computed. [2018-11-23 02:06:33,468 INFO L448 ceAbstractionStarter]: For program point L3288-2(lines 3282 3296) no Hoare annotation was computed. [2018-11-23 02:06:33,468 INFO L448 ceAbstractionStarter]: For program point L3569(lines 3569 3576) no Hoare annotation was computed. [2018-11-23 02:06:33,468 INFO L444 ceAbstractionStarter]: At program point L3272(line 3272) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or .cse1 (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))) .cse2)))) [2018-11-23 02:06:33,468 INFO L448 ceAbstractionStarter]: For program point L3305(lines 3305 3312) no Hoare annotation was computed. [2018-11-23 02:06:33,468 INFO L448 ceAbstractionStarter]: For program point L3272-1(line 3272) no Hoare annotation was computed. [2018-11-23 02:06:33,468 INFO L444 ceAbstractionStarter]: At program point L3586(line 3586) the Hoare annotation is: (let ((.cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (let ((.cse1 (let ((.cse3 (not (= 7 ~IPC~0))) (.cse4 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse6 (not (= ~SKIP2~0 4))) (.cse7 (= 1 |old(~pended~0)|)) (.cse8 (= 7 ~MPR3~0)) (.cse9 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse12 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse14 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= |old(~compRegistered~0)| 0))) (.cse16 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse0 .cse16)))) (.cse2 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2) (or (and (= 0 ~customIrp~0) (= ~compRegistered~0 ~routine~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (not (= ~pended~0 1))) .cse1 .cse2)))) [2018-11-23 02:06:33,468 INFO L444 ceAbstractionStarter]: At program point L7674(lines 7661 7702) the Hoare annotation is: (let ((.cse0 (= ~myIrp_PendingReturned~0 0))) (let ((.cse5 (and (and .cse0 (not (= ~MPR3~0 1)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (= 1 ~NP~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~pended~0 1)))) (.cse6 (not (= ~DC~0 4))) (.cse7 (= 4 ~SKIP2~0))) (let ((.cse2 (<= ~DC~0 2)) (.cse4 (= 7 ~IPC~0)) (.cse1 (and .cse5 .cse6 .cse7)) (.cse3 (= main_~status~15 ~lowerDriverReturn~0))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not .cse0) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (and .cse1 (= ~compRegistered~0 1) (not (= ~MPR3~0 7)) .cse2 .cse3) .cse4 (= ~IPC~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 259 main_~status~15)) .cse2 .cse4 (and (= ~DC~0 ~s~0) .cse1)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse5 .cse3 (= 4 ~s~0) .cse6 .cse7) (not (= |old(~customIrp~0)| 0)))))) [2018-11-23 02:06:33,468 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 7552 7709) no Hoare annotation was computed. [2018-11-23 02:06:33,468 INFO L448 ceAbstractionStarter]: For program point L7567-1(lines 7564 7708) no Hoare annotation was computed. [2018-11-23 02:06:33,468 INFO L444 ceAbstractionStarter]: At program point L7567(line 7567) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= ~myIrp_PendingReturned~0 0)) (and (= ~s~0 ~UNLOADED~0) (= 0 ~customIrp~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~compRegistered~0 ~routine~0) (= ~SKIP1~0 ~s~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~MPR3~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,469 INFO L444 ceAbstractionStarter]: At program point L7600(lines 7599 7626) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (and (= 0 ~compRegistered~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (= ~NP~0 ~s~0) (not (= ~MPR3~0 1)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (= 1 ~NP~0) (not (= ~DC~0 4)) (not (= ~pended~0 1)) (= 4 ~SKIP2~0)) (= 1 |old(~pended~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 (= ~myIrp_PendingReturned~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point L7658(lines 7658 7703) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point L7617(line 7617) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point L7593(lines 7593 7628) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point L7684(lines 7684 7700) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point L7676(lines 7676 7682) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 7604 7624) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point L7569(lines 7564 7708) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L444 ceAbstractionStarter]: At program point L7594(lines 7593 7628) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (<= ~DC~0 2)) (.cse2 (= 7 ~IPC~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ~routine~0 0)) (.cse5 (not (= ~MPR3~0 7))) (.cse6 (= ~NP~0 ~s~0)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (<= ~SKIP1~0 3)) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (= 1 ~NP~0)) (.cse11 (not (= ~pended~0 1))) (.cse12 (= 4 ~SKIP2~0))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= ~myIrp_PendingReturned~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~myStatus~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 (+ ~myStatus~0 1073741637)) .cse11 .cse12) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 7552 7709) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point L7693-1(lines 7639 7706) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point L7693(lines 7693 7699) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point L7586(lines 7569 7636) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 7604 7624) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L448 ceAbstractionStarter]: For program point L7685(lines 7685 7691) no Hoare annotation was computed. [2018-11-23 02:06:33,469 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 7552 7709) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= ~myIrp_PendingReturned~0 0)) (and (= ~s~0 ~UNLOADED~0) (= 0 ~customIrp~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~compRegistered~0 ~routine~0) (= ~SKIP1~0 ~s~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~MPR3~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,470 INFO L451 ceAbstractionStarter]: At program point L7603(lines 7602 7625) the Hoare annotation is: true [2018-11-23 02:06:33,470 INFO L448 ceAbstractionStarter]: For program point L7661(lines 7661 7702) no Hoare annotation was computed. [2018-11-23 02:06:33,470 INFO L444 ceAbstractionStarter]: At program point L7678(line 7678) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= ~myIrp_PendingReturned~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,470 INFO L448 ceAbstractionStarter]: For program point L7579(lines 7579 7584) no Hoare annotation was computed. [2018-11-23 02:06:33,470 INFO L448 ceAbstractionStarter]: For program point L7612(line 7612) no Hoare annotation was computed. [2018-11-23 02:06:33,470 INFO L444 ceAbstractionStarter]: At program point L7579-2(lines 7579 7584) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (<= ~DC~0 2)) (.cse2 (= 7 ~IPC~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ~routine~0 0)) (.cse5 (not (= ~MPR3~0 7))) (.cse6 (= ~NP~0 ~s~0)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (<= ~SKIP1~0 3)) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (= 1 ~NP~0)) (.cse11 (not (= ~pended~0 1))) (.cse12 (= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~myStatus~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 (+ ~myStatus~0 1073741637)) .cse11 .cse12))) (= 0 ~customIrp~0)) (not (= ~myIrp_PendingReturned~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,470 INFO L448 ceAbstractionStarter]: For program point L7662(lines 7662 7672) no Hoare annotation was computed. [2018-11-23 02:06:33,470 INFO L444 ceAbstractionStarter]: At program point L7695(line 7695) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= ~myIrp_PendingReturned~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,470 INFO L448 ceAbstractionStarter]: For program point L7596(lines 7596 7627) no Hoare annotation was computed. [2018-11-23 02:06:33,470 INFO L444 ceAbstractionStarter]: At program point L7654(lines 7647 7705) the Hoare annotation is: (let ((.cse6 (= ~myIrp_PendingReturned~0 0))) (let ((.cse0 (and .cse6 (not (= ~MPR3~0 1)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (= 1 ~NP~0))) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (not (= ~DC~0 4))) (.cse4 (not (= ~pended~0 1))) (.cse5 (= 4 ~SKIP2~0))) (let ((.cse2 (= main_~status~15 ~lowerDriverReturn~0)) (.cse8 (<= ~DC~0 2)) (.cse9 (= 7 ~IPC~0)) (.cse7 (and .cse0 .cse1 .cse3 .cse4 .cse5))) (or (and .cse0 .cse1 .cse2 (= 4 ~s~0) .cse3 .cse4 .cse5) (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= ~compRegistered~0 1) .cse7 (not (= ~MPR3~0 7)) .cse8 .cse9 .cse2 (= ~IPC~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 259 main_~status~15)) .cse8 .cse9 (and (= ~DC~0 ~s~0) .cse7)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))))) [2018-11-23 02:06:33,470 INFO L444 ceAbstractionStarter]: At program point L7687(line 7687) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= ~myIrp_PendingReturned~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,470 INFO L444 ceAbstractionStarter]: At program point L7646(lines 7639 7706) the Hoare annotation is: (let ((.cse6 (= ~myIrp_PendingReturned~0 0))) (let ((.cse0 (and .cse6 (not (= ~MPR3~0 1)) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (= 1 ~NP~0))) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (not (= ~DC~0 4))) (.cse4 (not (= ~pended~0 1))) (.cse5 (= 4 ~SKIP2~0))) (let ((.cse2 (= main_~status~15 ~lowerDriverReturn~0)) (.cse8 (<= ~DC~0 2)) (.cse9 (= 7 ~IPC~0)) (.cse7 (and .cse0 .cse1 .cse3 .cse4 .cse5))) (or (and .cse0 .cse1 .cse2 (= 4 ~s~0) .cse3 .cse4 .cse5) (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not .cse6) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= ~compRegistered~0 1) .cse7 (not (= ~MPR3~0 7)) .cse8 .cse9 .cse2 (= ~IPC~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= 259 main_~status~15)) .cse8 .cse9 (and (= ~DC~0 ~s~0) .cse7)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))))) [2018-11-23 02:06:33,471 INFO L448 ceAbstractionStarter]: For program point L7663(lines 7663 7669) no Hoare annotation was computed. [2018-11-23 02:06:33,471 INFO L444 ceAbstractionStarter]: At program point L7597(lines 7596 7627) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (<= ~DC~0 2)) (.cse2 (= 7 ~IPC~0)) (.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (= ~routine~0 0)) (.cse5 (not (= ~MPR3~0 7))) (.cse6 (= ~NP~0 ~s~0)) (.cse7 (not (= ~MPR3~0 1))) (.cse8 (<= ~SKIP1~0 3)) (.cse9 (<= 3 ~SKIP1~0)) (.cse10 (= 1 ~NP~0)) (.cse11 (not (= ~pended~0 1))) (.cse12 (= 4 ~SKIP2~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 ~myStatus~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 (+ ~myStatus~0 1073741637)) .cse11 .cse12))) (= 0 ~customIrp~0)) (not (= ~myIrp_PendingReturned~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,475 INFO L444 ceAbstractionStarter]: At program point L7623(lines 7569 7636) the Hoare annotation is: (let ((.cse0 (<= ~DC~0 2)) (.cse1 (= 7 ~IPC~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse9 (= main_~status~15 ~lowerDriverReturn~0)) (.cse3 (not (= ~MPR3~0 1))) (.cse4 (<= ~SKIP1~0 3)) (.cse5 (<= 3 ~SKIP1~0)) (.cse6 (= 1 ~NP~0)) (.cse7 (not (= ~pended~0 1))) (.cse8 (= 4 ~SKIP2~0))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= ~myIrp_PendingReturned~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (and .cse0 .cse1 .cse2 (= ~DC~0 ~s~0) (not (= 259 main_~status~15)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse0 .cse1 .cse2 .cse9 (= ~IPC~0 ~s~0) (= ~compRegistered~0 1) (not (= ~MPR3~0 7)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse2 .cse9 (= ~s~0 ~SKIP2~0) .cse3 .cse4 .cse5 .cse6 (not (= ~DC~0 4)) .cse7 .cse8) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:06:33,476 INFO L448 ceAbstractionStarter]: For program point L7648(lines 7648 7652) no Hoare annotation was computed. [2018-11-23 02:06:33,476 INFO L448 ceAbstractionStarter]: For program point L7607(line 7607) no Hoare annotation was computed. [2018-11-23 02:06:33,476 INFO L448 ceAbstractionStarter]: For program point L7640(lines 7640 7644) no Hoare annotation was computed. [2018-11-23 02:06:33,476 INFO L448 ceAbstractionStarter]: For program point L7599(lines 7599 7626) no Hoare annotation was computed. [2018-11-23 02:06:33,476 INFO L444 ceAbstractionStarter]: At program point L7665(line 7665) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~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 (= ~myIrp_PendingReturned~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,476 INFO L448 ceAbstractionStarter]: For program point L8172-1(lines 8164 8177) no Hoare annotation was computed. [2018-11-23 02:06:33,476 INFO L444 ceAbstractionStarter]: At program point L8172(line 8172) the Hoare annotation is: (or (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse3 (< 2 ~DC~0)) (.cse5 (= 1 ~pended~0)) (.cse9 (not (= ~myIrp_PendingReturned~0 0))) (.cse13 (= 1 ~MPR3~0)) (.cse1 (not (= 7 ~IPC~0))) (.cse2 (< 3 ~SKIP1~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse6 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= 1 ~routine~0))) (.cse10 (not (= 1 ~NP~0))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse12 .cse13) (or .cse0 .cse3 .cse5 .cse9 .cse13 (< ~MPR1~0 5) .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637)))))) (not (= ~customIrp~0 0))) [2018-11-23 02:06:33,485 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 8164 8177) the Hoare annotation is: (or (= ~s~0 |old(~s~0)|) (or (let ((.cse0 (not (= ~setEventCalled~0 1))) (.cse3 (< 2 ~DC~0)) (.cse5 (= 1 ~pended~0)) (.cse9 (not (= ~myIrp_PendingReturned~0 0))) (.cse13 (= 1 ~MPR3~0)) (.cse1 (not (= 7 ~IPC~0))) (.cse2 (< 3 ~SKIP1~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse6 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= 1 ~routine~0))) (.cse10 (not (= 1 ~NP~0))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse12 .cse13) (or .cse0 .cse3 .cse5 .cse9 .cse13 (< ~MPR1~0 5) .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637)))))) (not (= ~customIrp~0 0)))) [2018-11-23 02:06:33,485 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 8164 8177) no Hoare annotation was computed. [2018-11-23 02:06:33,485 INFO L448 ceAbstractionStarter]: For program point L8545(lines 8545 8559) no Hoare annotation was computed. [2018-11-23 02:06:33,485 INFO L448 ceAbstractionStarter]: For program point L8607(lines 8607 8614) no Hoare annotation was computed. [2018-11-23 02:06:33,485 INFO L444 ceAbstractionStarter]: At program point L8574(lines 8573 8592) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,485 INFO L444 ceAbstractionStarter]: At program point L8562(line 8562) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,485 INFO L448 ceAbstractionStarter]: For program point L8599(lines 8599 8605) no Hoare annotation was computed. [2018-11-23 02:06:33,485 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 8535 8619) no Hoare annotation was computed. [2018-11-23 02:06:33,485 INFO L444 ceAbstractionStarter]: At program point L8612(line 8612) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,485 INFO L448 ceAbstractionStarter]: For program point L8612-1(lines 8594 8616) no Hoare annotation was computed. [2018-11-23 02:06:33,485 INFO L444 ceAbstractionStarter]: At program point L8571(lines 8570 8593) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,493 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 8535 8619) no Hoare annotation was computed. [2018-11-23 02:06:33,493 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 8535 8619) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,493 INFO L448 ceAbstractionStarter]: For program point L8551-2(lines 8544 8567) no Hoare annotation was computed. [2018-11-23 02:06:33,494 INFO L444 ceAbstractionStarter]: At program point L8547(line 8547) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,494 INFO L448 ceAbstractionStarter]: For program point L8547-1(line 8547) no Hoare annotation was computed. [2018-11-23 02:06:33,494 INFO L448 ceAbstractionStarter]: For program point L8551(lines 8551 8558) no Hoare annotation was computed. [2018-11-23 02:06:33,494 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 8578 8590) no Hoare annotation was computed. [2018-11-23 02:06:33,494 INFO L444 ceAbstractionStarter]: At program point L8589(lines 8543 8618) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,494 INFO L448 ceAbstractionStarter]: For program point $Ultimate##17(lines 8578 8590) no Hoare annotation was computed. [2018-11-23 02:06:33,494 INFO L448 ceAbstractionStarter]: For program point L8573(lines 8573 8592) no Hoare annotation was computed. [2018-11-23 02:06:33,494 INFO L444 ceAbstractionStarter]: At program point L8577(lines 8576 8591) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,494 INFO L448 ceAbstractionStarter]: For program point L8544(lines 8544 8569) no Hoare annotation was computed. [2018-11-23 02:06:33,494 INFO L448 ceAbstractionStarter]: For program point L8544-1(lines 8543 8618) no Hoare annotation was computed. [2018-11-23 02:06:33,494 INFO L448 ceAbstractionStarter]: For program point L8598(lines 8598 8615) no Hoare annotation was computed. [2018-11-23 02:06:33,494 INFO L444 ceAbstractionStarter]: At program point L8553(line 8553) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,494 INFO L448 ceAbstractionStarter]: For program point L8553-1(line 8553) no Hoare annotation was computed. [2018-11-23 02:06:33,494 INFO L448 ceAbstractionStarter]: For program point L3873(lines 3873 3877) no Hoare annotation was computed. [2018-11-23 02:06:33,500 INFO L444 ceAbstractionStarter]: At program point L3902(line 3902) the Hoare annotation is: (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 ~pended~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= ~NP~0 ~s~0) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,500 INFO L448 ceAbstractionStarter]: For program point L3900(lines 3900 3907) no Hoare annotation was computed. [2018-11-23 02:06:33,500 INFO L448 ceAbstractionStarter]: For program point L3902-1(line 3902) no Hoare annotation was computed. [2018-11-23 02:06:33,500 INFO L448 ceAbstractionStarter]: For program point L3900-2(lines 3871 3926) no Hoare annotation was computed. [2018-11-23 02:06:33,500 INFO L444 ceAbstractionStarter]: At program point CdAudioIsPlayActiveENTRY(lines 3861 3927) the Hoare annotation is: (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 ~pended~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= ~NP~0 ~s~0) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,500 INFO L448 ceAbstractionStarter]: For program point L3892(lines 3892 3899) no Hoare annotation was computed. [2018-11-23 02:06:33,500 INFO L448 ceAbstractionStarter]: For program point L3882(lines 3882 3886) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveEXIT(lines 3861 3927) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point L3916(lines 3916 3921) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point L3916-2(lines 3916 3921) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point CdAudioIsPlayActiveFINAL(lines 3861 3927) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point L3879-1(line 3879) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L444 ceAbstractionStarter]: At program point L3879(line 3879) the Hoare annotation is: (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 ~pended~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= ~NP~0 ~s~0) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point L2814(lines 2814 2818) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point L2812(lines 2812 2818) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point IoOpenDeviceRegistryKeyEXIT(lines 2811 2819) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L451 ceAbstractionStarter]: At program point IoOpenDeviceRegistryKeyENTRY(lines 2811 2819) the Hoare annotation is: true [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point IoOpenDeviceRegistryKeyFINAL(lines 2811 2819) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L451 ceAbstractionStarter]: At program point InterlockedIncrementENTRY(lines 2683 2685) the Hoare annotation is: true [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point InterlockedIncrementFINAL(lines 2683 2685) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point InterlockedIncrementEXIT(lines 2683 2685) no Hoare annotation was computed. [2018-11-23 02:06:33,501 INFO L448 ceAbstractionStarter]: For program point L8382(lines 8382 8403) no Hoare annotation was computed. [2018-11-23 02:06:33,512 INFO L448 ceAbstractionStarter]: For program point L8415(lines 8377 8420) no Hoare annotation was computed. [2018-11-23 02:06:33,512 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 8377 8420) no Hoare annotation was computed. [2018-11-23 02:06:33,512 INFO L444 ceAbstractionStarter]: At program point L8405(lines 8404 8418) the Hoare annotation is: (let ((.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse16 (not (= 1 ~routine~0))) (.cse1 (= 0 ~customIrp~0)) (.cse6 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse8 (not (= ~myStatus~0 0))) (.cse18 (not (= |old(~customIrp~0)| 0))) (.cse0 (= ~NP~0 ~s~0)) (.cse17 (= 1 ~MPR3~0)) (.cse3 (not (= 7 ~IPC~0))) (.cse13 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse9 (not (= ~SKIP2~0 4))) (.cse14 (= 1 ~pended~0)) (.cse7 (= 7 ~MPR3~0)) (.cse15 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse21 (not (= 0 ~routine~0))) (.cse19 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse22 (not (= ~compRegistered~0 0)))) (and (or (and .cse0 .cse1) (or (let ((.cse4 (or .cse9 (or .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ~compRegistered~0 ~routine~0)) .cse15 .cse16 .cse17)))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse2 .cse3 .cse8 .cse4 .cse5 .cse7))) (not (= |old(~s~0)| ~MPR3~0)) .cse18)) (or (or (let ((.cse20 (not (= ~compRegistered~0 1)))) (and (or .cse2 .cse17 .cse8 .cse3 .cse13 .cse5 .cse9 .cse14 .cse7 .cse15 .cse16 .cse10 .cse11 .cse19 .cse12 .cse20) (or .cse2 .cse17 .cse3 .cse13 .cse5 .cse9 .cse14 .cse7 .cse15 .cse16 .cse10 .cse11 .cse19 .cse12 .cse20 .cse6))) .cse18) (and (and .cse0 (= 1 ~setEventCalled~0)) .cse1)) (or .cse1 (or (and (or .cse17 .cse3 .cse13 .cse5 .cse9 .cse14 .cse7 .cse15 .cse10 .cse11 .cse21 .cse19 .cse12 .cse22 .cse6) (or .cse17 .cse8 .cse3 .cse13 .cse5 .cse9 .cse14 .cse7 .cse15 .cse10 .cse11 .cse21 .cse19 .cse12 .cse22)) .cse18)) (or .cse0 .cse17 .cse3 .cse13 .cse5 .cse9 .cse14 .cse7 .cse15 .cse10 .cse11 .cse21 .cse19 .cse12 .cse22))) [2018-11-23 02:06:33,512 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 8409 8416) no Hoare annotation was computed. [2018-11-23 02:06:33,512 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 8409 8416) no Hoare annotation was computed. [2018-11-23 02:06:33,512 INFO L448 ceAbstractionStarter]: For program point L8395-1(lines 8381 8419) no Hoare annotation was computed. [2018-11-23 02:06:33,512 INFO L448 ceAbstractionStarter]: For program point L8395(lines 8395 8401) no Hoare annotation was computed. [2018-11-23 02:06:33,513 INFO L444 ceAbstractionStarter]: At program point L8397(line 8397) the Hoare annotation is: (let ((.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse16 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse12 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= 7 ~IPC~0))) (.cse13 (not (= ~myStatus~0 0))) (.cse3 (< 2 ~DC~0)) (.cse6 (= 7 ~MPR3~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (< 3 ~SKIP1~0)) (.cse5 (= 1 ~pended~0)) (.cse7 (< ~SKIP1~0 3)) (.cse14 (not (= 1 ~routine~0))) (.cse0 (= 1 ~MPR3~0)) (.cse17 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 ~routine~0)) .cse10 .cse11 (not (= ~compRegistered~0 0))) (or (let ((.cse15 (not (= ~compRegistered~0 1)))) (and (or .cse12 .cse0 .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse15) (or .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse15 .cse16))) .cse17) (or (let ((.cse18 (or .cse4 (or .cse8 .cse9 .cse11 .cse2 .cse5 (not (= ~compRegistered~0 ~routine~0)) .cse7 .cse14 .cse0)))) (and (or .cse12 .cse1 .cse18 .cse3 .cse16 .cse6) (or .cse12 .cse1 .cse13 .cse18 .cse3 .cse6))) (not (= |old(~s~0)| ~MPR3~0)) .cse17))) [2018-11-23 02:06:33,519 INFO L448 ceAbstractionStarter]: For program point L8383(lines 8383 8388) no Hoare annotation was computed. [2018-11-23 02:06:33,519 INFO L444 ceAbstractionStarter]: At program point L8408(lines 8407 8417) the Hoare annotation is: (let ((.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse16 (not (= 1 ~routine~0))) (.cse1 (= 0 ~customIrp~0)) (.cse6 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse8 (not (= ~myStatus~0 0))) (.cse18 (not (= |old(~customIrp~0)| 0))) (.cse0 (= ~NP~0 ~s~0)) (.cse17 (= 1 ~MPR3~0)) (.cse3 (not (= 7 ~IPC~0))) (.cse13 (< 3 ~SKIP1~0)) (.cse5 (< 2 ~DC~0)) (.cse9 (not (= ~SKIP2~0 4))) (.cse14 (= 1 ~pended~0)) (.cse7 (= 7 ~MPR3~0)) (.cse15 (< ~SKIP1~0 3)) (.cse10 (not (= ~myIrp_PendingReturned~0 0))) (.cse11 (not (= 1 ~NP~0))) (.cse21 (not (= 0 ~routine~0))) (.cse19 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse22 (not (= ~compRegistered~0 0)))) (and (or (and .cse0 .cse1) (or (let ((.cse4 (or .cse9 (or .cse10 .cse11 .cse12 .cse13 .cse14 (not (= ~compRegistered~0 ~routine~0)) .cse15 .cse16 .cse17)))) (and (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse2 .cse3 .cse8 .cse4 .cse5 .cse7))) (not (= |old(~s~0)| ~MPR3~0)) .cse18)) (or (or (let ((.cse20 (not (= ~compRegistered~0 1)))) (and (or .cse2 .cse17 .cse8 .cse3 .cse13 .cse5 .cse9 .cse14 .cse7 .cse15 .cse16 .cse10 .cse11 .cse19 .cse12 .cse20) (or .cse2 .cse17 .cse3 .cse13 .cse5 .cse9 .cse14 .cse7 .cse15 .cse16 .cse10 .cse11 .cse19 .cse12 .cse20 .cse6))) .cse18) (and (and .cse0 (= 1 ~setEventCalled~0)) .cse1)) (or .cse1 (or (and (or .cse17 .cse3 .cse13 .cse5 .cse9 .cse14 .cse7 .cse15 .cse10 .cse11 .cse21 .cse19 .cse12 .cse22 .cse6) (or .cse17 .cse8 .cse3 .cse13 .cse5 .cse9 .cse14 .cse7 .cse15 .cse10 .cse11 .cse21 .cse19 .cse12 .cse22)) .cse18)) (or .cse0 .cse17 .cse3 .cse13 .cse5 .cse9 .cse14 .cse7 .cse15 .cse10 .cse11 .cse21 .cse19 .cse12 .cse22))) [2018-11-23 02:06:33,520 INFO L444 ceAbstractionStarter]: At program point L8390(lines 8382 8403) the Hoare annotation is: (let ((.cse14 (= 0 ~customIrp~0)) (.cse10 (not (= 0 ~routine~0))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse13 (not (= ~compRegistered~0 0))) (.cse19 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse15 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (= 7 ~IPC~0))) (.cse16 (not (= ~myStatus~0 0))) (.cse3 (< 2 ~DC~0)) (.cse6 (= 7 ~MPR3~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (< 3 ~SKIP1~0)) (.cse5 (= 1 ~pended~0)) (.cse7 (< ~SKIP1~0 3)) (.cse17 (not (= 1 ~routine~0))) (.cse0 (= 1 ~MPR3~0)) (.cse20 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~NP~0 ~s~0)) (or (and .cse14 (and (= 1 ~setEventCalled~0) (= |old(~s~0)| ~s~0))) (or (let ((.cse18 (not (= ~compRegistered~0 1)))) (and (or .cse15 .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse18) (or .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse18 .cse19))) .cse20)) (or .cse14 (or (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19) (or .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) .cse20)) (or (let ((.cse21 (or .cse4 (or .cse8 .cse9 .cse12 .cse2 .cse5 (not (= ~compRegistered~0 ~routine~0)) .cse7 .cse17 .cse0)))) (and (or .cse15 .cse1 .cse21 .cse3 .cse19 .cse6) (or .cse15 .cse1 .cse16 .cse21 .cse3 .cse6))) (not (= |old(~s~0)| ~MPR3~0)) .cse20))) [2018-11-23 02:06:33,529 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 8377 8420) the Hoare annotation is: (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse14 (not (= 1 ~routine~0))) (.cse18 (= 1 ~setEventCalled~0)) (.cse17 (= 0 ~customIrp~0)) (.cse4 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse6 (not (= ~myStatus~0 0))) (.cse16 (not (= |old(~customIrp~0)| 0))) (.cse15 (= 1 ~MPR3~0)) (.cse1 (not (= 7 ~IPC~0))) (.cse11 (< 3 ~SKIP1~0)) (.cse3 (< 2 ~DC~0)) (.cse7 (not (= ~SKIP2~0 4))) (.cse12 (= 1 ~pended~0)) (.cse5 (= 7 ~MPR3~0)) (.cse13 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse21 (not (= 0 ~routine~0))) (.cse19 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse22 (not (= ~compRegistered~0 0)))) (and (or (or (let ((.cse2 (or .cse7 (or .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~compRegistered~0 ~routine~0)) .cse13 .cse14 .cse15)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse5))) (not (= |old(~s~0)| ~MPR3~0)) .cse16) (and .cse17 .cse18 (= ~MPR3~0 ~s~0))) (or (or (let ((.cse20 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse15 .cse6 .cse1 .cse11 .cse3 .cse7 .cse12 .cse5 .cse13 .cse14 .cse8 .cse9 .cse19 .cse10 .cse20) (or .cse0 .cse15 .cse1 .cse11 .cse3 .cse7 .cse12 .cse5 .cse13 .cse14 .cse8 .cse9 .cse19 .cse10 .cse20 .cse4))) .cse16) (and .cse17 .cse18 (= |old(~s~0)| ~s~0))) (or .cse17 (or (and (or .cse15 .cse1 .cse11 .cse3 .cse7 .cse12 .cse5 .cse13 .cse8 .cse9 .cse21 .cse19 .cse10 .cse22 .cse4) (or .cse15 .cse6 .cse1 .cse11 .cse3 .cse7 .cse12 .cse5 .cse13 .cse8 .cse9 .cse21 .cse19 .cse10 .cse22)) .cse16)) (or .cse15 .cse1 .cse11 .cse3 .cse7 .cse12 .cse5 .cse13 .cse8 .cse9 .cse21 .cse19 .cse10 (= ~NP~0 ~s~0) .cse22))) [2018-11-23 02:06:33,529 INFO L448 ceAbstractionStarter]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2018-11-23 02:06:33,529 INFO L444 ceAbstractionStarter]: At program point L7422(line 7422) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse13 (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse14 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637))) .cse14))) [2018-11-23 02:06:33,537 INFO L444 ceAbstractionStarter]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse10 (not (= 0 |old(~routine~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= |old(~compRegistered~0)| 0))) (.cse6 (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) (.cse14 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 (+ ~myStatus~0 1073741637))) .cse14) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse6 .cse14))) [2018-11-23 02:06:33,537 INFO L448 ceAbstractionStarter]: For program point L7387(lines 7387 7425) no Hoare annotation was computed. [2018-11-23 02:06:33,537 INFO L448 ceAbstractionStarter]: For program point L7422-1(line 7422) no Hoare annotation was computed. [2018-11-23 02:06:33,537 INFO L448 ceAbstractionStarter]: For program point L7417-1(line 7417) no Hoare annotation was computed. [2018-11-23 02:06:33,537 INFO L444 ceAbstractionStarter]: At program point L7417(line 7417) the Hoare annotation is: (let ((.cse13 (and (= ~compRegistered~0 1) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) (.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse14 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637))) .cse14))) [2018-11-23 02:06:33,537 INFO L444 ceAbstractionStarter]: At program point CdAudioHPCdrDeviceControlENTRY(lines 7373 7428) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse10 (not (= 0 |old(~routine~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= |old(~compRegistered~0)| 0))) (.cse6 (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) (.cse14 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 (+ ~myStatus~0 1073741637))) .cse14) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse6 .cse14))) [2018-11-23 02:06:33,543 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlEXIT(lines 7373 7428) no Hoare annotation was computed. [2018-11-23 02:06:33,543 INFO L448 ceAbstractionStarter]: For program point L7399-1(lines 7394 7408) no Hoare annotation was computed. [2018-11-23 02:06:33,543 INFO L448 ceAbstractionStarter]: For program point L7399(lines 7399 7407) no Hoare annotation was computed. [2018-11-23 02:06:33,544 INFO L444 ceAbstractionStarter]: At program point L7401(line 7401) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637))) .cse13) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2018-11-23 02:06:33,544 INFO L448 ceAbstractionStarter]: For program point L7394(lines 7394 7408) no Hoare annotation was computed. [2018-11-23 02:06:33,544 INFO L448 ceAbstractionStarter]: For program point CdAudioHPCdrDeviceControlFINAL(lines 7373 7428) no Hoare annotation was computed. [2018-11-23 02:06:33,544 INFO L444 ceAbstractionStarter]: At program point L7396(line 7396) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637))) .cse13) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2018-11-23 02:06:33,544 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 8272 8285) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 ~pended~0)) (.cse5 (< ~SKIP1~0 3)) (.cse6 (not (= ~myIrp_PendingReturned~0 0))) (.cse7 (not (= 1 ~NP~0))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ~routine~0)) .cse8 .cse9 (not (= ~compRegistered~0 0)) (= ~NP~0 ~s~0) .cse10) (or (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 7 ~MPR3~0) .cse5 (not (= 1 ~routine~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~compRegistered~0 1)) .cse10) (= |old(~s~0)| ~s~0) (not (= ~customIrp~0 0))))) [2018-11-23 02:06:33,555 INFO L448 ceAbstractionStarter]: For program point L8280-1(lines 8272 8285) no Hoare annotation was computed. [2018-11-23 02:06:33,555 INFO L444 ceAbstractionStarter]: At program point L8280(line 8280) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 ~pended~0)) (.cse5 (< ~SKIP1~0 3)) (.cse6 (not (= ~myIrp_PendingReturned~0 0))) (.cse7 (not (= 1 ~NP~0))) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 0 ~routine~0)) .cse8 .cse9 (not (= ~compRegistered~0 0)) .cse10) (or (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 7 ~MPR3~0) .cse5 (not (= 1 ~routine~0)) .cse6 .cse7 .cse8 .cse9 (not (= ~compRegistered~0 1)) .cse10) (not (= ~customIrp~0 0))))) [2018-11-23 02:06:33,556 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 8272 8285) no Hoare annotation was computed. [2018-11-23 02:06:33,556 INFO L448 ceAbstractionStarter]: For program point L8276(lines 8276 8282) no Hoare annotation was computed. [2018-11-23 02:06:33,556 INFO L448 ceAbstractionStarter]: For program point NecSupportNeededFINAL(lines 3730 3760) no Hoare annotation was computed. [2018-11-23 02:06:33,556 INFO L448 ceAbstractionStarter]: For program point NecSupportNeededEXIT(lines 3730 3760) no Hoare annotation was computed. [2018-11-23 02:06:33,556 INFO L448 ceAbstractionStarter]: For program point L3753(lines 3753 3757) no Hoare annotation was computed. [2018-11-23 02:06:33,556 INFO L451 ceAbstractionStarter]: At program point NecSupportNeededENTRY(lines 3730 3760) the Hoare annotation is: true [2018-11-23 02:06:33,556 INFO L448 ceAbstractionStarter]: For program point L3751-1(line 3751) no Hoare annotation was computed. [2018-11-23 02:06:33,556 INFO L451 ceAbstractionStarter]: At program point L3751(line 3751) the Hoare annotation is: true [2018-11-23 02:06:33,556 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 02:06:33,556 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:06:33,556 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:06:33,556 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:06:33,556 INFO L448 ceAbstractionStarter]: For program point L7503-1(lines 7499 7505) no Hoare annotation was computed. [2018-11-23 02:06:33,556 INFO L444 ceAbstractionStarter]: At program point L7503(line 7503) the Hoare annotation is: (or (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (< 3 ~SKIP1~0) (= 1 |old(~pended~0)|) (not (= ~SKIP2~0 4)) (not (= ~compRegistered~0 0)) (< ~SKIP1~0 3) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,556 INFO L448 ceAbstractionStarter]: For program point L7499(lines 7499 7505) no Hoare annotation was computed. [2018-11-23 02:06:33,556 INFO L444 ceAbstractionStarter]: At program point CdAudioPowerENTRY(lines 7491 7514) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (< 3 ~SKIP1~0) (= 1 |old(~pended~0)|) (not (= ~SKIP2~0 4)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,563 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerFINAL(lines 7491 7514) no Hoare annotation was computed. [2018-11-23 02:06:33,564 INFO L444 ceAbstractionStarter]: At program point L7510(line 7510) the Hoare annotation is: (or (< 3 ~SKIP1~0) (= 1 |old(~pended~0)|) (not (= ~SKIP2~0 4)) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,564 INFO L448 ceAbstractionStarter]: For program point CdAudioPowerEXIT(lines 7491 7514) no Hoare annotation was computed. [2018-11-23 02:06:33,564 INFO L448 ceAbstractionStarter]: For program point L7510-1(line 7510) no Hoare annotation was computed. [2018-11-23 02:06:33,564 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionFINAL(lines 7347 7372) no Hoare annotation was computed. [2018-11-23 02:06:33,564 INFO L448 ceAbstractionStarter]: For program point L7356-1(lines 7352 7358) no Hoare annotation was computed. [2018-11-23 02:06:33,564 INFO L444 ceAbstractionStarter]: At program point L7356(line 7356) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse10 (not (= ~s~0 ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= ~compRegistered~0 1))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637))) .cse13))) [2018-11-23 02:06:33,564 INFO L444 ceAbstractionStarter]: At program point HPCdrCompletionENTRY(lines 7347 7372) the Hoare annotation is: (let ((.cse13 (not (= ~pended~0 1))) (.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse10 (not (= ~s~0 ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= ~compRegistered~0 1))) (.cse14 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637))) .cse14))) [2018-11-23 02:06:33,564 INFO L448 ceAbstractionStarter]: For program point L7351(lines 7351 7362) no Hoare annotation was computed. [2018-11-23 02:06:33,564 INFO L448 ceAbstractionStarter]: For program point L7352(lines 7352 7358) no Hoare annotation was computed. [2018-11-23 02:06:33,564 INFO L448 ceAbstractionStarter]: For program point HPCdrCompletionEXIT(lines 7347 7372) no Hoare annotation was computed. [2018-11-23 02:06:33,564 INFO L448 ceAbstractionStarter]: For program point L7351-2(lines 7350 7371) no Hoare annotation was computed. [2018-11-23 02:06:33,564 INFO L448 ceAbstractionStarter]: For program point L7363-1(lines 7363 7369) no Hoare annotation was computed. [2018-11-23 02:06:33,564 INFO L448 ceAbstractionStarter]: For program point L7365-1(line 7365) no Hoare annotation was computed. [2018-11-23 02:06:33,565 INFO L444 ceAbstractionStarter]: At program point L7365(line 7365) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse10 (not (= ~s~0 ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= ~compRegistered~0 1))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~pended~0 1)) .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637))) .cse13))) [2018-11-23 02:06:33,576 INFO L451 ceAbstractionStarter]: At program point HpCdrProcessLastSessionENTRY(lines 7330 7346) the Hoare annotation is: true [2018-11-23 02:06:33,576 INFO L448 ceAbstractionStarter]: For program point L7335(lines 7335 7343) no Hoare annotation was computed. [2018-11-23 02:06:33,576 INFO L448 ceAbstractionStarter]: For program point HpCdrProcessLastSessionEXIT(lines 7330 7346) no Hoare annotation was computed. [2018-11-23 02:06:33,576 INFO L448 ceAbstractionStarter]: For program point L7335-2(lines 7330 7346) no Hoare annotation was computed. [2018-11-23 02:06:33,576 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 8365 8372) the Hoare annotation is: true [2018-11-23 02:06:33,576 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 8365 8372) no Hoare annotation was computed. [2018-11-23 02:06:33,577 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 8365 8372) no Hoare annotation was computed. [2018-11-23 02:06:33,577 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 7538 7551) no Hoare annotation was computed. [2018-11-23 02:06:33,577 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 7538 7551) the Hoare annotation is: (or (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ ~myStatus~0 1073741637))) .cse13))) (not (= |old(~customIrp~0)| 0))) (and (and (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= 0 ~customIrp~0))) [2018-11-23 02:06:33,577 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 7538 7551) no Hoare annotation was computed. [2018-11-23 02:06:33,577 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:06:33,577 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-23 02:06:33,577 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:06:33,577 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:06:33,577 INFO L451 ceAbstractionStarter]: At program point CdAudioSignalCompletionENTRY(lines 3156 3165) the Hoare annotation is: true [2018-11-23 02:06:33,577 INFO L448 ceAbstractionStarter]: For program point L3161-1(line 3161) no Hoare annotation was computed. [2018-11-23 02:06:33,577 INFO L451 ceAbstractionStarter]: At program point L3161(line 3161) the Hoare annotation is: true [2018-11-23 02:06:33,582 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionFINAL(lines 3156 3165) no Hoare annotation was computed. [2018-11-23 02:06:33,582 INFO L448 ceAbstractionStarter]: For program point CdAudioSignalCompletionEXIT(lines 3156 3165) no Hoare annotation was computed. [2018-11-23 02:06:33,582 INFO L448 ceAbstractionStarter]: For program point L3669(lines 3669 3677) no Hoare annotation was computed. [2018-11-23 02:06:33,582 INFO L448 ceAbstractionStarter]: For program point L3669-2(lines 3669 3677) no Hoare annotation was computed. [2018-11-23 02:06:33,583 INFO L444 ceAbstractionStarter]: At program point L3620(lines 3619 3711) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= 0 ~customIrp~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= |old(~s~0)| ~s~0) (not (= 259 CdAudioPnp_~status~3)) (not (= ~pended~0 1))) (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13))) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:06:33,583 INFO L448 ceAbstractionStarter]: For program point L3653(lines 3653 3658) no Hoare annotation was computed. [2018-11-23 02:06:33,583 INFO L448 ceAbstractionStarter]: For program point L3678(lines 3678 3686) no Hoare annotation was computed. [2018-11-23 02:06:33,583 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 3627 3708) no Hoare annotation was computed. [2018-11-23 02:06:33,583 INFO L448 ceAbstractionStarter]: For program point L3707(line 3707) no Hoare annotation was computed. [2018-11-23 02:06:33,583 INFO L448 ceAbstractionStarter]: For program point L3703(line 3703) no Hoare annotation was computed. [2018-11-23 02:06:33,583 INFO L448 ceAbstractionStarter]: For program point L3637(lines 3637 3644) no Hoare annotation was computed. [2018-11-23 02:06:33,583 INFO L448 ceAbstractionStarter]: For program point L3666(line 3666) no Hoare annotation was computed. [2018-11-23 02:06:33,583 INFO L448 ceAbstractionStarter]: For program point L3633-1(line 3633) no Hoare annotation was computed. [2018-11-23 02:06:33,583 INFO L444 ceAbstractionStarter]: At program point L3633(line 3633) the Hoare annotation is: (or (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~customIrp~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= 259 CdAudioPnp_~status~3)) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,583 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpEXIT(lines 3608 3714) no Hoare annotation was computed. [2018-11-23 02:06:33,583 INFO L444 ceAbstractionStarter]: At program point CdAudioPnpENTRY(lines 3608 3714) the Hoare annotation is: (let ((.cse7 (not (= |old(~myStatus~0)| 0))) (.cse1 (not (= 0 (+ |old(~myStatus~0)| 1073741637))))) (let ((.cse0 (or (let ((.cse8 (not (= 7 ~IPC~0))) (.cse9 (< 3 ~SKIP1~0)) (.cse10 (< 2 ~DC~0)) (.cse11 (not (= ~SKIP2~0 4))) (.cse12 (= 1 |old(~pended~0)|)) (.cse13 (= 7 ~MPR3~0)) (.cse14 (< ~SKIP1~0 3)) (.cse15 (not (= ~myIrp_PendingReturned~0 0))) (.cse16 (not (= 1 ~NP~0))) (.cse17 (not (= 0 |old(~routine~0)|))) (.cse18 (not (= |old(~s~0)| ~NP~0))) (.cse19 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse20 (not (= |old(~compRegistered~0)| 0))) (.cse21 (= 1 ~MPR3~0))) (and (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse1 .cse21))) (not (= |old(~customIrp~0)| 0)))) (.cse6 (= 0 ~customIrp~0)) (.cse2 (= 0 ~compRegistered~0)) (.cse3 (= ~routine~0 0)) (.cse4 (= ~NP~0 ~s~0)) (.cse5 (not (= ~pended~0 1)))) (and (or .cse0 .cse1 (and (and (and .cse2 .cse3 .cse4 .cse5) .cse6) (= 0 (+ ~myStatus~0 1073741637)))) (or .cse0 .cse7 (and .cse6 (and .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5)))))) [2018-11-23 02:06:33,594 INFO L448 ceAbstractionStarter]: For program point CdAudioPnpFINAL(lines 3608 3714) no Hoare annotation was computed. [2018-11-23 02:06:33,594 INFO L448 ceAbstractionStarter]: For program point L3679(lines 3679 3683) no Hoare annotation was computed. [2018-11-23 02:06:33,594 INFO L448 ceAbstractionStarter]: For program point L3675-1(line 3675) no Hoare annotation was computed. [2018-11-23 02:06:33,595 INFO L444 ceAbstractionStarter]: At program point L3675(line 3675) the Hoare annotation is: (let ((.cse1 (not (= 0 (+ |old(~myStatus~0)| 1073741637))))) (let ((.cse0 (or (let ((.cse2 (not (= 7 ~IPC~0))) (.cse3 (< 3 ~SKIP1~0)) (.cse4 (< 2 ~DC~0)) (.cse5 (not (= ~SKIP2~0 4))) (.cse6 (= 1 |old(~pended~0)|)) (.cse7 (= 7 ~MPR3~0)) (.cse8 (< ~SKIP1~0 3)) (.cse9 (not (= ~myIrp_PendingReturned~0 0))) (.cse10 (not (= 1 ~NP~0))) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= |old(~compRegistered~0)| 0))) (.cse15 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse1 .cse15))) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (and (and (= 0 ~myStatus~0) (= ~compRegistered~0 ~routine~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (not (= ~pended~0 1))) (= 0 ~customIrp~0) (= CdAudioPnp_~status~3 0))) (or .cse0 .cse1)))) [2018-11-23 02:06:33,595 INFO L448 ceAbstractionStarter]: For program point L3671-1(line 3671) no Hoare annotation was computed. [2018-11-23 02:06:33,595 INFO L444 ceAbstractionStarter]: At program point L3671(line 3671) the Hoare annotation is: (let ((.cse1 (not (= 0 (+ |old(~myStatus~0)| 1073741637))))) (let ((.cse0 (or (let ((.cse2 (not (= 7 ~IPC~0))) (.cse3 (< 3 ~SKIP1~0)) (.cse4 (< 2 ~DC~0)) (.cse5 (not (= ~SKIP2~0 4))) (.cse6 (= 1 |old(~pended~0)|)) (.cse7 (= 7 ~MPR3~0)) (.cse8 (< ~SKIP1~0 3)) (.cse9 (not (= ~myIrp_PendingReturned~0 0))) (.cse10 (not (= 1 ~NP~0))) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= |old(~compRegistered~0)| 0))) (.cse15 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse1 .cse15))) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (and (and (= 0 ~myStatus~0) (= ~compRegistered~0 ~routine~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (not (= ~pended~0 1))) (= 0 ~customIrp~0) (= CdAudioPnp_~status~3 0))) (or .cse0 .cse1)))) [2018-11-23 02:06:33,595 INFO L448 ceAbstractionStarter]: For program point L3696(line 3696) no Hoare annotation was computed. [2018-11-23 02:06:33,601 INFO L448 ceAbstractionStarter]: For program point L3630(line 3630) no Hoare annotation was computed. [2018-11-23 02:06:33,602 INFO L444 ceAbstractionStarter]: At program point L3626(lines 3625 3709) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13))) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:06:33,602 INFO L448 ceAbstractionStarter]: For program point L3688(lines 3688 3693) no Hoare annotation was computed. [2018-11-23 02:06:33,602 INFO L448 ceAbstractionStarter]: For program point L3622(lines 3622 3710) no Hoare annotation was computed. [2018-11-23 02:06:33,602 INFO L444 ceAbstractionStarter]: At program point L3688-2(lines 3668 3694) the Hoare annotation is: (let ((.cse1 (not (= 0 (+ |old(~myStatus~0)| 1073741637))))) (let ((.cse0 (or (let ((.cse2 (not (= 7 ~IPC~0))) (.cse3 (< 3 ~SKIP1~0)) (.cse4 (< 2 ~DC~0)) (.cse5 (not (= ~SKIP2~0 4))) (.cse6 (= 1 |old(~pended~0)|)) (.cse7 (= 7 ~MPR3~0)) (.cse8 (< ~SKIP1~0 3)) (.cse9 (not (= ~myIrp_PendingReturned~0 0))) (.cse10 (not (= 1 ~NP~0))) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= |old(~compRegistered~0)| 0))) (.cse15 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse1 .cse15))) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (and (and (= 0 ~myStatus~0) (= ~compRegistered~0 ~routine~0) (= ~NP~0 ~s~0) (= ~routine~0 1) (not (= ~pended~0 1))) (= 0 ~customIrp~0) (= CdAudioPnp_~status~3 0))) (or .cse0 .cse1)))) [2018-11-23 02:06:33,602 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 3627 3708) no Hoare annotation was computed. [2018-11-23 02:06:33,602 INFO L444 ceAbstractionStarter]: At program point L3651-1(lines 3651 3664) the Hoare annotation is: (let ((.cse5 (not (= |old(~myStatus~0)| 0))) (.cse6 (not (= 0 (+ |old(~myStatus~0)| 1073741637))))) (let ((.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ~routine~0 0)) (.cse3 (not (= ~pended~0 1))) (.cse0 (= 0 ~customIrp~0)) (.cse4 (or (let ((.cse7 (not (= 7 ~IPC~0))) (.cse8 (< 3 ~SKIP1~0)) (.cse9 (< 2 ~DC~0)) (.cse10 (not (= ~SKIP2~0 4))) (.cse11 (= 1 |old(~pended~0)|)) (.cse12 (= 7 ~MPR3~0)) (.cse13 (< ~SKIP1~0 3)) (.cse14 (not (= ~myIrp_PendingReturned~0 0))) (.cse15 (not (= 1 ~NP~0))) (.cse16 (not (= 0 |old(~routine~0)|))) (.cse17 (not (= |old(~s~0)| ~NP~0))) (.cse18 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse19 (not (= |old(~compRegistered~0)| 0))) (.cse20 (= 1 ~MPR3~0))) (and (or .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse6 .cse20))) (not (= |old(~customIrp~0)| 0))))) (and (or (and .cse0 (and .cse1 .cse2 (= 0 ~myStatus~0) (= ~NP~0 ~s~0) .cse3)) .cse4 .cse5) (or (and (and (and .cse1 .cse2 .cse3) (= ~s~0 |old(~s~0)|) .cse0) (= 0 (+ ~myStatus~0 1073741637))) .cse4 .cse6)))) [2018-11-23 02:06:33,602 INFO L448 ceAbstractionStarter]: For program point L3651(lines 3651 3664) no Hoare annotation was computed. [2018-11-23 02:06:33,608 INFO L448 ceAbstractionStarter]: For program point L3647-1(lines 3647 3648) no Hoare annotation was computed. [2018-11-23 02:06:33,608 INFO L444 ceAbstractionStarter]: At program point L3647(lines 3647 3648) the Hoare annotation is: (let ((.cse0 (or (let ((.cse1 (not (= 7 ~IPC~0))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (< 2 ~DC~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse5 (= 1 |old(~pended~0)|)) (.cse6 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse10 (not (= 0 |old(~routine~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= |old(~compRegistered~0)| 0))) (.cse14 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse14))) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (and (and (= 0 ~customIrp~0) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) (or (= |old(~myStatus~0)| CdAudioPnp_~status~3) (= (+ CdAudioPnp_~status~3 1073741637) 0)))) (or (= |old(~myStatus~0)| ~myStatus~0) .cse0))) [2018-11-23 02:06:33,608 INFO L448 ceAbstractionStarter]: For program point L3639-1(line 3639) no Hoare annotation was computed. [2018-11-23 02:06:33,608 INFO L444 ceAbstractionStarter]: At program point L3639(line 3639) the Hoare annotation is: (or (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13))) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= 0 (+ ~myStatus~0 1073741637)) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,608 INFO L448 ceAbstractionStarter]: For program point L3668(lines 3668 3694) no Hoare annotation was computed. [2018-11-23 02:06:33,608 INFO L448 ceAbstractionStarter]: For program point L3697-1(line 3697) no Hoare annotation was computed. [2018-11-23 02:06:33,608 INFO L444 ceAbstractionStarter]: At program point L3697(line 3697) the Hoare annotation is: (let ((.cse1 (not (= 0 (+ |old(~myStatus~0)| 1073741637))))) (let ((.cse0 (or (let ((.cse2 (not (= 7 ~IPC~0))) (.cse3 (< 3 ~SKIP1~0)) (.cse4 (< 2 ~DC~0)) (.cse5 (not (= ~SKIP2~0 4))) (.cse6 (= 1 |old(~pended~0)|)) (.cse7 (= 7 ~MPR3~0)) (.cse8 (< ~SKIP1~0 3)) (.cse9 (not (= ~myIrp_PendingReturned~0 0))) (.cse10 (not (= 1 ~NP~0))) (.cse11 (not (= 0 |old(~routine~0)|))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= |old(~compRegistered~0)| 0))) (.cse15 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse1 .cse15))) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (and (= |old(~myStatus~0)| ~myStatus~0) (and (= 0 ~customIrp~0) (= CdAudioPnp_~status~3 0) (= ~NP~0 ~s~0) (= 1 ~setEventCalled~0) (= ~routine~0 1) (= ~compRegistered~0 1) (not (= ~pended~0 1))))) (or .cse0 .cse1)))) [2018-11-23 02:06:33,608 INFO L444 ceAbstractionStarter]: At program point L3623(lines 3622 3710) the Hoare annotation is: (let ((.cse0 (or (let ((.cse1 (not (= 7 ~IPC~0))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (< 2 ~DC~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse5 (= 1 |old(~pended~0)|)) (.cse6 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse10 (not (= 0 |old(~routine~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= |old(~compRegistered~0)| 0))) (.cse14 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse14))) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (and (and (= 0 ~customIrp~0) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) (or (= |old(~myStatus~0)| CdAudioPnp_~status~3) (= (+ CdAudioPnp_~status~3 1073741637) 0)))) (or (= |old(~myStatus~0)| ~myStatus~0) .cse0))) [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point L3652(lines 3652 3661) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point L3619(lines 3619 3711) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point RtlCompareMemoryEXIT(lines 8709 8716) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L451 ceAbstractionStarter]: At program point RtlCompareMemoryENTRY(lines 8709 8716) the Hoare annotation is: true [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point RtlCompareMemoryFINAL(lines 8709 8716) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 2841 2847) the Hoare annotation is: true [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 2841 2847) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 2841 2847) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2845) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point L6526(lines 6526 6532) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point L6460-2(lines 6460 6464) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point L6460(lines 6460 6464) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point L6609-1(lines 6609 6629) no Hoare annotation was computed. [2018-11-23 02:06:33,616 INFO L448 ceAbstractionStarter]: For program point L6609(lines 6609 6629) no Hoare annotation was computed. [2018-11-23 02:06:33,617 INFO L448 ceAbstractionStarter]: For program point L6444(lines 6444 6456) no Hoare annotation was computed. [2018-11-23 02:06:33,617 INFO L444 ceAbstractionStarter]: At program point L6312(lines 6311 6710) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,617 INFO L448 ceAbstractionStarter]: For program point L6692(line 6692) no Hoare annotation was computed. [2018-11-23 02:06:33,617 INFO L448 ceAbstractionStarter]: For program point L6329(lines 6329 6704) no Hoare annotation was computed. [2018-11-23 02:06:33,617 INFO L448 ceAbstractionStarter]: For program point L6610(lines 6610 6619) no Hoare annotation was computed. [2018-11-23 02:06:33,624 INFO L448 ceAbstractionStarter]: For program point L6346(lines 6346 6352) no Hoare annotation was computed. [2018-11-23 02:06:33,624 INFO L448 ceAbstractionStarter]: For program point L6445(lines 6445 6453) no Hoare annotation was computed. [2018-11-23 02:06:33,624 INFO L444 ceAbstractionStarter]: At program point L6726(line 6726) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (not (= CdAudio535DeviceControl_~status~11 259)) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,624 INFO L448 ceAbstractionStarter]: For program point L6726-1(line 6726) no Hoare annotation was computed. [2018-11-23 02:06:33,624 INFO L444 ceAbstractionStarter]: At program point L6330(lines 6329 6704) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,624 INFO L448 ceAbstractionStarter]: For program point L6611(lines 6611 6616) no Hoare annotation was computed. [2018-11-23 02:06:33,624 INFO L448 ceAbstractionStarter]: For program point L6314(lines 6314 6709) no Hoare annotation was computed. [2018-11-23 02:06:33,625 INFO L448 ceAbstractionStarter]: For program point L6413-1(line 6413) no Hoare annotation was computed. [2018-11-23 02:06:33,625 INFO L444 ceAbstractionStarter]: At program point L6413(line 6413) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,625 INFO L444 ceAbstractionStarter]: At program point L6479-2(lines 6479 6495) the Hoare annotation is: (or (and (not (= CdAudio535DeviceControl_~status~11 259)) (<= 0 (+ CdAudio535DeviceControl_~status~11 1073741789)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,625 INFO L444 ceAbstractionStarter]: At program point L6694(lines 6332 6703) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,625 INFO L444 ceAbstractionStarter]: At program point L6496(lines 6334 6700) the Hoare annotation is: (or (and (not (= CdAudio535DeviceControl_~status~11 259)) (<= 0 (+ CdAudio535DeviceControl_~status~11 1073741789)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,625 INFO L448 ceAbstractionStarter]: For program point L6480(lines 6479 6495) no Hoare annotation was computed. [2018-11-23 02:06:33,640 INFO L444 ceAbstractionStarter]: At program point L6315(lines 6314 6709) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,640 INFO L448 ceAbstractionStarter]: For program point L6547(lines 6547 6557) no Hoare annotation was computed. [2018-11-23 02:06:33,640 INFO L448 ceAbstractionStarter]: For program point L6415(lines 6415 6421) no Hoare annotation was computed. [2018-11-23 02:06:33,640 INFO L448 ceAbstractionStarter]: For program point L6481(lines 6481 6485) no Hoare annotation was computed. [2018-11-23 02:06:33,640 INFO L444 ceAbstractionStarter]: At program point CdAudio535DeviceControlENTRY(lines 6268 6730) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,640 INFO L448 ceAbstractionStarter]: For program point L6696(line 6696) no Hoare annotation was computed. [2018-11-23 02:06:33,640 INFO L444 ceAbstractionStarter]: At program point L6366(line 6366) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,640 INFO L448 ceAbstractionStarter]: For program point L6498-1(lines 6498 6510) no Hoare annotation was computed. [2018-11-23 02:06:33,640 INFO L448 ceAbstractionStarter]: For program point L6300-1(line 6300) no Hoare annotation was computed. [2018-11-23 02:06:33,641 INFO L444 ceAbstractionStarter]: At program point L6300(line 6300) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,641 INFO L448 ceAbstractionStarter]: For program point L6366-1(line 6366) no Hoare annotation was computed. [2018-11-23 02:06:33,641 INFO L448 ceAbstractionStarter]: For program point L6680-1(lines 6680 6681) no Hoare annotation was computed. [2018-11-23 02:06:33,641 INFO L444 ceAbstractionStarter]: At program point L6680(lines 6680 6681) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,641 INFO L448 ceAbstractionStarter]: For program point L6317(lines 6317 6708) no Hoare annotation was computed. [2018-11-23 02:06:33,641 INFO L448 ceAbstractionStarter]: For program point L6664-1(lines 6664 6665) no Hoare annotation was computed. [2018-11-23 02:06:33,641 INFO L444 ceAbstractionStarter]: At program point L6664(lines 6664 6665) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,657 INFO L444 ceAbstractionStarter]: At program point L6318(lines 6317 6708) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,657 INFO L444 ceAbstractionStarter]: At program point L6566(lines 6566 6567) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,657 INFO L444 ceAbstractionStarter]: At program point L6434(line 6434) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,657 INFO L448 ceAbstractionStarter]: For program point L6566-1(lines 6566 6567) no Hoare annotation was computed. [2018-11-23 02:06:33,657 INFO L448 ceAbstractionStarter]: For program point L6302(lines 6302 6713) no Hoare annotation was computed. [2018-11-23 02:06:33,657 INFO L448 ceAbstractionStarter]: For program point L6434-1(line 6434) no Hoare annotation was computed. [2018-11-23 02:06:33,657 INFO L448 ceAbstractionStarter]: For program point L6715-1(lines 6715 6722) no Hoare annotation was computed. [2018-11-23 02:06:33,657 INFO L444 ceAbstractionStarter]: At program point L6550(line 6550) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,657 INFO L448 ceAbstractionStarter]: For program point L6649(lines 6649 6654) no Hoare annotation was computed. [2018-11-23 02:06:33,657 INFO L448 ceAbstractionStarter]: For program point L6550-1(line 6550) no Hoare annotation was computed. [2018-11-23 02:06:33,657 INFO L448 ceAbstractionStarter]: For program point L6385-1(line 6385) no Hoare annotation was computed. [2018-11-23 02:06:33,658 INFO L444 ceAbstractionStarter]: At program point L6385(line 6385) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (not (= CdAudio535DeviceControl_~status~11 259)) (= ~NP~0 ~s~0) (<= 0 (+ CdAudio535DeviceControl_~status~11 1073741789)) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,658 INFO L448 ceAbstractionStarter]: For program point L6633-1(lines 6633 6634) no Hoare annotation was computed. [2018-11-23 02:06:33,658 INFO L444 ceAbstractionStarter]: At program point L6633(lines 6633 6634) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,665 INFO L444 ceAbstractionStarter]: At program point L6303(lines 6302 6713) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,665 INFO L448 ceAbstractionStarter]: For program point L6320(lines 6320 6707) no Hoare annotation was computed. [2018-11-23 02:06:33,665 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlEXIT(lines 6268 6730) no Hoare annotation was computed. [2018-11-23 02:06:33,665 INFO L448 ceAbstractionStarter]: For program point L6667(lines 6667 6671) no Hoare annotation was computed. [2018-11-23 02:06:33,665 INFO L444 ceAbstractionStarter]: At program point L6370(lines 6370 6371) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,665 INFO L448 ceAbstractionStarter]: For program point L6337(line 6337) no Hoare annotation was computed. [2018-11-23 02:06:33,665 INFO L448 ceAbstractionStarter]: For program point L6370-1(lines 6370 6371) no Hoare annotation was computed. [2018-11-23 02:06:33,665 INFO L448 ceAbstractionStarter]: For program point L6519-1(lines 6519 6520) no Hoare annotation was computed. [2018-11-23 02:06:33,665 INFO L444 ceAbstractionStarter]: At program point L6519(lines 6519 6520) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,666 INFO L444 ceAbstractionStarter]: At program point L6354(lines 6354 6355) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,666 INFO L448 ceAbstractionStarter]: For program point L6354-1(lines 6354 6355) no Hoare annotation was computed. [2018-11-23 02:06:33,666 INFO L444 ceAbstractionStarter]: At program point L6701(lines 6294 6729) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (not (= CdAudio535DeviceControl_~status~11 259)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))))) [2018-11-23 02:06:33,666 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 6334 6702) no Hoare annotation was computed. [2018-11-23 02:06:33,666 INFO L448 ceAbstractionStarter]: For program point L6569(lines 6569 6595) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point $Ultimate##22(lines 6334 6702) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6305(lines 6305 6712) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6570(lines 6570 6574) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6603(lines 6603 6608) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6636(lines 6636 6644) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6570-2(lines 6570 6574) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6537(lines 6537 6546) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L444 ceAbstractionStarter]: At program point L6306(lines 6305 6712) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6339(lines 6339 6345) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6405(lines 6405 6411) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6323(lines 6323 6706) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6389(lines 6389 6396) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6637(lines 6637 6641) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6472-2(lines 6472 6476) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6472(lines 6472 6476) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6373(lines 6373 6381) no Hoare annotation was computed. [2018-11-23 02:06:33,669 INFO L444 ceAbstractionStarter]: At program point L6621(lines 6609 6629) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,669 INFO L448 ceAbstractionStarter]: For program point L6423-1(line 6423) no Hoare annotation was computed. [2018-11-23 02:06:33,670 INFO L444 ceAbstractionStarter]: At program point L6423(line 6423) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,670 INFO L448 ceAbstractionStarter]: For program point L6539-1(line 6539) no Hoare annotation was computed. [2018-11-23 02:06:33,670 INFO L444 ceAbstractionStarter]: At program point L6539(line 6539) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,672 INFO L448 ceAbstractionStarter]: For program point L6308(lines 6308 6711) no Hoare annotation was computed. [2018-11-23 02:06:33,672 INFO L448 ceAbstractionStarter]: For program point L6523(lines 6523 6536) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point L6358(lines 6358 6364) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point CdAudio535DeviceControlFINAL(lines 6268 6730) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point L6441-1(line 6441) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L444 ceAbstractionStarter]: At program point L6441(line 6441) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,673 INFO L444 ceAbstractionStarter]: At program point L6309(lines 6308 6711) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point L6326(lines 6326 6705) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point L6426(lines 6426 6432) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L444 ceAbstractionStarter]: At program point L6327(lines 6320 6707) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point L6443-1(lines 6443 6459) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point L6443(lines 6443 6459) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point L6311(lines 6311 6710) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L451 ceAbstractionStarter]: At program point nondet_mallocENTRY(lines 7711 7725) the Hoare annotation is: true [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point nondet_mallocFINAL(lines 7711 7725) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point nondet_mallocEXIT(lines 7711 7725) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point L7716(lines 7716 7723) no Hoare annotation was computed. [2018-11-23 02:06:33,673 INFO L448 ceAbstractionStarter]: For program point L8190(lines 8190 8215) no Hoare annotation was computed. [2018-11-23 02:06:33,674 INFO L444 ceAbstractionStarter]: At program point L8223(lines 8222 8241) the Hoare annotation is: (let ((.cse17 (not (= ~pended~0 1)))) (let ((.cse14 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse18 (not (= ~myStatus~0 0))) (.cse0 (and (= ~NP~0 ~s~0) .cse17)) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse13 (not (= ~compRegistered~0 1))) (.cse1 (not (= 7 ~IPC~0))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (< 2 ~DC~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse5 (= 1 |old(~pended~0)|)) (.cse6 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse10 (not (= 0 ~routine~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or (let ((.cse16 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (<= .cse16 0) (<= 0 .cse16) (= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) .cse17)) (or (let ((.cse19 (not (= 1 ~routine~0)))) (and (or .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15))) (not (= ~customIrp~0 0)))) (or .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (or (and .cse17 (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (= ~compRegistered~0 0)) .cse15)))) [2018-11-23 02:06:33,677 INFO L448 ceAbstractionStarter]: For program point L8219(lines 8219 8242) no Hoare annotation was computed. [2018-11-23 02:06:33,678 INFO L448 ceAbstractionStarter]: For program point L8190-1(lines 8189 8268) no Hoare annotation was computed. [2018-11-23 02:06:33,678 INFO L448 ceAbstractionStarter]: For program point L8248(lines 8248 8265) no Hoare annotation was computed. [2018-11-23 02:06:33,678 INFO L448 ceAbstractionStarter]: For program point L8199-1(line 8199) no Hoare annotation was computed. [2018-11-23 02:06:33,678 INFO L444 ceAbstractionStarter]: At program point L8199(line 8199) the Hoare annotation is: (let ((.cse14 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse15 (not (= ~myStatus~0 0))) (.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= ~compRegistered~0 1))) (.cse11 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~compRegistered~0 0)) .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse13 .cse14 .cse11) (or (and (= |old(~s~0)| ~s~0) (not (= ~pended~0 1))) (let ((.cse16 (not (= 1 ~routine~0)))) (and (or .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse12 .cse10 .cse13 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse12 .cse10 .cse13 .cse14 .cse11))) (not (= ~customIrp~0 0))) (or .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse13 .cse11))) [2018-11-23 02:06:33,678 INFO L448 ceAbstractionStarter]: For program point L8191(lines 8191 8205) no Hoare annotation was computed. [2018-11-23 02:06:33,678 INFO L448 ceAbstractionStarter]: For program point L8257(lines 8257 8264) no Hoare annotation was computed. [2018-11-23 02:06:33,678 INFO L444 ceAbstractionStarter]: At program point L8220(lines 8219 8242) the Hoare annotation is: (let ((.cse17 (not (= ~pended~0 1)))) (let ((.cse14 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse18 (not (= ~myStatus~0 0))) (.cse0 (and (= ~NP~0 ~s~0) .cse17)) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse13 (not (= ~compRegistered~0 1))) (.cse1 (not (= 7 ~IPC~0))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (< 2 ~DC~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse5 (= 1 |old(~pended~0)|)) (.cse6 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse10 (not (= 0 ~routine~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or (let ((.cse16 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (<= .cse16 0) (<= 0 .cse16) (= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) .cse17)) (or (let ((.cse19 (not (= 1 ~routine~0)))) (and (or .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15))) (not (= ~customIrp~0 0)))) (or .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (or (and .cse17 (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (= ~compRegistered~0 0)) .cse15)))) [2018-11-23 02:06:33,684 INFO L448 ceAbstractionStarter]: For program point L8249(lines 8249 8255) no Hoare annotation was computed. [2018-11-23 02:06:33,684 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 8180 8269) the Hoare annotation is: (let ((.cse17 (not (= ~pended~0 1)))) (let ((.cse0 (and (= ~NP~0 ~s~0) .cse17)) (.cse10 (not (= 0 ~routine~0))) (.cse16 (not (= ~myStatus~0 0))) (.cse1 (not (= 7 ~IPC~0))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (< 2 ~DC~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse5 (= 1 |old(~pended~0)|)) (.cse6 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= ~compRegistered~0 1))) (.cse14 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse15 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse0 .cse15) (or (and .cse17 (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (= ~compRegistered~0 0)) .cse15) (or (and (= |old(~s~0)| ~s~0) .cse17) (let ((.cse18 (not (= 1 ~routine~0)))) (and (or .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15))) (not (= ~customIrp~0 0)))))) [2018-11-23 02:06:33,684 INFO L444 ceAbstractionStarter]: At program point L8208(line 8208) the Hoare annotation is: (let ((.cse14 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse16 (not (= ~myStatus~0 0))) (.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse12 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= ~compRegistered~0 1))) (.cse11 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~compRegistered~0 0)) .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse13 .cse14 .cse11) (or (let ((.cse15 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (<= .cse15 0) (<= 0 .cse15) (= 1 ~setEventCalled~0) (= |old(~s~0)| ~s~0) (not (= ~pended~0 1)))) (let ((.cse17 (not (= 1 ~routine~0)))) (and (or .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse12 .cse10 .cse13 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse12 .cse10 .cse13 .cse14 .cse11))) (not (= ~customIrp~0 0))) (or .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse13 .cse11))) [2018-11-23 02:06:33,698 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 8227 8239) no Hoare annotation was computed. [2018-11-23 02:06:33,698 INFO L444 ceAbstractionStarter]: At program point L8262(line 8262) the Hoare annotation is: (let ((.cse16 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse12 (not (= ~myStatus~0 0))) (.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (not (= ~compRegistered~0 1))) (.cse11 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~compRegistered~0 0)) .cse11) (or (let ((.cse13 (not (= 1 ~routine~0)))) (and (or .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse14 .cse10 .cse15 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse14 .cse10 .cse15 .cse16 .cse11))) (not (= ~customIrp~0 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse15 .cse16 .cse11) (or .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse15 .cse11))) [2018-11-23 02:06:33,698 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 8227 8239) no Hoare annotation was computed. [2018-11-23 02:06:33,698 INFO L448 ceAbstractionStarter]: For program point L8262-1(lines 8244 8266) no Hoare annotation was computed. [2018-11-23 02:06:33,698 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 8180 8269) no Hoare annotation was computed. [2018-11-23 02:06:33,698 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 8180 8269) no Hoare annotation was computed. [2018-11-23 02:06:33,699 INFO L444 ceAbstractionStarter]: At program point L8238(lines 8189 8268) the Hoare annotation is: (let ((.cse17 (not (= ~pended~0 1)))) (let ((.cse0 (not (= ~myStatus~0 0))) (.cse14 (and (= ~NP~0 ~s~0) .cse17)) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse13 (not (= ~compRegistered~0 1))) (.cse19 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse1 (not (= 7 ~IPC~0))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (< 2 ~DC~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse5 (= 1 |old(~pended~0)|)) (.cse6 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse10 (not (= 0 ~routine~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or (let ((.cse16 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (<= .cse16 0) (<= 0 .cse16) (= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) .cse17)) (or (let ((.cse18 (not (= 1 ~routine~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse8 .cse9 .cse11 .cse12 .cse13 .cse19 .cse15))) (not (= ~customIrp~0 0)))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse19 .cse15) (or (and .cse17 (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (= ~compRegistered~0 0)) .cse15)))) [2018-11-23 02:06:33,710 INFO L444 ceAbstractionStarter]: At program point L8226(lines 8225 8240) the Hoare annotation is: (let ((.cse17 (not (= ~pended~0 1)))) (let ((.cse14 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse18 (not (= ~myStatus~0 0))) (.cse0 (and (= ~NP~0 ~s~0) .cse17)) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse13 (not (= ~compRegistered~0 1))) (.cse1 (not (= 7 ~IPC~0))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (< 2 ~DC~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse5 (= 1 |old(~pended~0)|)) (.cse6 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse10 (not (= 0 ~routine~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or (let ((.cse16 (+ IofCallDriver_~compRetStatus~0 1073741802))) (and (<= .cse16 0) (<= 0 .cse16) (= 1 ~setEventCalled~0) (= ~MPR1~0 ~s~0) .cse17)) (or (let ((.cse19 (not (= 1 ~routine~0)))) (and (or .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15))) (not (= ~customIrp~0 0)))) (or .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (or (and .cse17 (= ~SKIP1~0 ~s~0)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (= ~compRegistered~0 0)) .cse15)))) [2018-11-23 02:06:33,710 INFO L448 ceAbstractionStarter]: For program point L8197-2(lines 8190 8213) no Hoare annotation was computed. [2018-11-23 02:06:33,710 INFO L448 ceAbstractionStarter]: For program point L8197(lines 8197 8204) no Hoare annotation was computed. [2018-11-23 02:06:33,710 INFO L448 ceAbstractionStarter]: For program point L8222(lines 8222 8241) no Hoare annotation was computed. [2018-11-23 02:06:33,710 INFO L448 ceAbstractionStarter]: For program point L8193-1(line 8193) no Hoare annotation was computed. [2018-11-23 02:06:33,710 INFO L444 ceAbstractionStarter]: At program point L8193(line 8193) the Hoare annotation is: (let ((.cse0 (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) (.cse10 (not (= 0 ~routine~0))) (.cse16 (not (= ~myStatus~0 0))) (.cse1 (not (= 7 ~IPC~0))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (< 2 ~DC~0)) (.cse4 (not (= ~SKIP2~0 4))) (.cse5 (= 1 |old(~pended~0)|)) (.cse6 (= 7 ~MPR3~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (not (= ~myIrp_PendingReturned~0 0))) (.cse9 (not (= 1 ~NP~0))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= ~compRegistered~0 1))) (.cse14 (not (= 0 (+ ~myStatus~0 1073741637)))) (.cse15 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse0 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~SKIP1~0 |old(~s~0)|)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (not (= ~compRegistered~0 0)) .cse15) (or (let ((.cse17 (not (= 1 ~routine~0)))) (and (or .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15))) (not (= ~customIrp~0 0))))) [2018-11-23 02:06:33,722 INFO L451 ceAbstractionStarter]: At program point RtlWriteRegistryValueENTRY(lines 2657 2663) the Hoare annotation is: true [2018-11-23 02:06:33,722 INFO L448 ceAbstractionStarter]: For program point RtlWriteRegistryValueEXIT(lines 2657 2663) no Hoare annotation was computed. [2018-11-23 02:06:33,722 INFO L448 ceAbstractionStarter]: For program point RtlWriteRegistryValueFINAL(lines 2657 2663) no Hoare annotation was computed. [2018-11-23 02:06:33,722 INFO L448 ceAbstractionStarter]: For program point L2658(lines 2658 2662) no Hoare annotation was computed. [2018-11-23 02:06:33,722 INFO L444 ceAbstractionStarter]: At program point L3856(line 3856) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (and (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,723 INFO L444 ceAbstractionStarter]: At program point CdAudioSendToNextDriverENTRY(lines 3840 3860) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (< ~SKIP1~0 3) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,723 INFO L448 ceAbstractionStarter]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2018-11-23 02:06:33,723 INFO L444 ceAbstractionStarter]: At program point L3850(line 3850) the Hoare annotation is: (or (< 3 ~SKIP1~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 4 ~DC~0) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,723 INFO L448 ceAbstractionStarter]: For program point L3850-1(lines 3846 3852) no Hoare annotation was computed. [2018-11-23 02:06:33,723 INFO L448 ceAbstractionStarter]: For program point L3846(lines 3846 3852) no Hoare annotation was computed. [2018-11-23 02:06:33,723 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverFINAL(lines 3840 3860) no Hoare annotation was computed. [2018-11-23 02:06:33,723 INFO L448 ceAbstractionStarter]: For program point CdAudioSendToNextDriverEXIT(lines 3840 3860) no Hoare annotation was computed. [2018-11-23 02:06:33,723 INFO L451 ceAbstractionStarter]: At program point MmLockPagableDataSectionENTRY(line 2741) the Hoare annotation is: true [2018-11-23 02:06:33,735 INFO L448 ceAbstractionStarter]: For program point MmLockPagableDataSectionEXIT(line 2741) no Hoare annotation was computed. [2018-11-23 02:06:33,735 INFO L448 ceAbstractionStarter]: For program point MmLockPagableDataSectionFINAL(line 2741) no Hoare annotation was computed. [2018-11-23 02:06:33,735 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:06:33,735 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~customIrp~0 |old(~customIrp~0)|) (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0)) [2018-11-23 02:06:33,735 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:06:33,735 INFO L451 ceAbstractionStarter]: At program point InterlockedDecrementENTRY(lines 2686 2688) the Hoare annotation is: true [2018-11-23 02:06:33,735 INFO L448 ceAbstractionStarter]: For program point InterlockedDecrementEXIT(lines 2686 2688) no Hoare annotation was computed. [2018-11-23 02:06:33,735 INFO L448 ceAbstractionStarter]: For program point InterlockedDecrementFINAL(lines 2686 2688) no Hoare annotation was computed. [2018-11-23 02:06:33,735 INFO L448 ceAbstractionStarter]: For program point L7296-1(lines 7296 7321) no Hoare annotation was computed. [2018-11-23 02:06:33,735 INFO L448 ceAbstractionStarter]: For program point L7296(lines 7296 7321) no Hoare annotation was computed. [2018-11-23 02:06:33,735 INFO L448 ceAbstractionStarter]: For program point L7325-1(line 7325) no Hoare annotation was computed. [2018-11-23 02:06:33,735 INFO L444 ceAbstractionStarter]: At program point L7325(line 7325) the Hoare annotation is: (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (and (not (= CdAudioAtapiDeviceControl_~status~13 259)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,735 INFO L444 ceAbstractionStarter]: At program point L7318(line 7318) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= ~compRegistered~0 0))) (.cse13 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 0 (+ ~myStatus~0 1073741637)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) .cse13))) [2018-11-23 02:06:33,735 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlEXIT(lines 7284 7329) no Hoare annotation was computed. [2018-11-23 02:06:33,736 INFO L444 ceAbstractionStarter]: At program point CdAudioAtapiDeviceControlENTRY(lines 7284 7329) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= ~compRegistered~0 0))) (.cse13 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) (= 0 (+ ~myStatus~0 1073741637)) .cse13) (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2018-11-23 02:06:33,741 INFO L448 ceAbstractionStarter]: For program point L7318-1(line 7318) no Hoare annotation was computed. [2018-11-23 02:06:33,741 INFO L444 ceAbstractionStarter]: At program point L7310(line 7310) the Hoare annotation is: (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (and (not (= CdAudioAtapiDeviceControl_~status~13 259)) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,741 INFO L448 ceAbstractionStarter]: For program point L7306(lines 7306 7315) no Hoare annotation was computed. [2018-11-23 02:06:33,741 INFO L448 ceAbstractionStarter]: For program point L7310-1(line 7310) no Hoare annotation was computed. [2018-11-23 02:06:33,742 INFO L448 ceAbstractionStarter]: For program point L7304-1(line 7304) no Hoare annotation was computed. [2018-11-23 02:06:33,742 INFO L444 ceAbstractionStarter]: At program point L7304(line 7304) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= ~compRegistered~0 0))) (.cse13 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) (= 0 (+ ~myStatus~0 1073741637)) .cse13) (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2018-11-23 02:06:33,742 INFO L448 ceAbstractionStarter]: For program point L7300-1(line 7300) no Hoare annotation was computed. [2018-11-23 02:06:33,742 INFO L444 ceAbstractionStarter]: At program point L7300(line 7300) the Hoare annotation is: (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 ~routine~0))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= ~compRegistered~0 0))) (.cse13 (= 1 ~MPR3~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) (= 0 (+ ~myStatus~0 1073741637)) .cse13) (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2018-11-23 02:06:33,742 INFO L448 ceAbstractionStarter]: For program point CdAudioAtapiDeviceControlFINAL(lines 7284 7329) no Hoare annotation was computed. [2018-11-23 02:06:33,742 INFO L444 ceAbstractionStarter]: At program point L3830(lines 3803 3831) the Hoare annotation is: (let ((.cse1 (= 0 (+ ~myStatus~0 1073741637))) (.cse3 (= ~lowerDriverReturn~0 CdAudioDeviceControl_~status~4)) (.cse0 (= ~routine~0 0)) (.cse2 (not (= ~pended~0 1)))) (or (and (= ~IPC~0 ~s~0) (= ~compRegistered~0 1) .cse0 .cse1 .cse2 .cse3) (and (= ~s~0 ~SKIP2~0) .cse0 .cse1 .cse2 .cse3) (and (not (= 259 CdAudioDeviceControl_~status~4)) (= ~DC~0 ~s~0) .cse0 .cse2) (let ((.cse4 (not (= 7 ~IPC~0))) (.cse5 (< 3 ~SKIP1~0)) (.cse6 (< 2 ~DC~0)) (.cse7 (not (= ~SKIP2~0 4))) (.cse8 (= 1 |old(~pended~0)|)) (.cse9 (= 7 ~MPR3~0)) (.cse10 (< ~SKIP1~0 3)) (.cse11 (not (= ~myIrp_PendingReturned~0 0))) (.cse12 (not (= 1 ~NP~0))) (.cse13 (not (= 0 |old(~routine~0)|))) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (not (= |old(~compRegistered~0)| 0))) (.cse17 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse17))))) [2018-11-23 02:06:33,751 INFO L444 ceAbstractionStarter]: At program point L3799(lines 3798 3833) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= 0 (+ ~myStatus~0 1073741637)) (not (= ~pended~0 1))) (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13)))) [2018-11-23 02:06:33,751 INFO L448 ceAbstractionStarter]: For program point L3795(lines 3795 3834) no Hoare annotation was computed. [2018-11-23 02:06:33,751 INFO L444 ceAbstractionStarter]: At program point L3793(lines 3792 3835) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13)))) [2018-11-23 02:06:33,751 INFO L448 ceAbstractionStarter]: For program point L3789(lines 3789 3836) no Hoare annotation was computed. [2018-11-23 02:06:33,752 INFO L448 ceAbstractionStarter]: For program point L3816(line 3816) no Hoare annotation was computed. [2018-11-23 02:06:33,752 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 3803 3831) no Hoare annotation was computed. [2018-11-23 02:06:33,752 INFO L448 ceAbstractionStarter]: For program point $Ultimate##9(lines 3803 3831) no Hoare annotation was computed. [2018-11-23 02:06:33,752 INFO L448 ceAbstractionStarter]: For program point L3806(line 3806) no Hoare annotation was computed. [2018-11-23 02:06:33,752 INFO L444 ceAbstractionStarter]: At program point L3802(lines 3801 3832) the Hoare annotation is: (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13))) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= 0 (+ ~myStatus~0 1073741637)) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,764 INFO L448 ceAbstractionStarter]: For program point L3798(lines 3798 3833) no Hoare annotation was computed. [2018-11-23 02:06:33,764 INFO L444 ceAbstractionStarter]: At program point L3796(lines 3795 3834) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= 0 (+ ~myStatus~0 1073741637)) (not (= ~pended~0 1))) (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13)))) [2018-11-23 02:06:33,764 INFO L448 ceAbstractionStarter]: For program point L3827-1(line 3827) no Hoare annotation was computed. [2018-11-23 02:06:33,764 INFO L444 ceAbstractionStarter]: At program point L3827(line 3827) the Hoare annotation is: (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13))) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= 0 (+ ~myStatus~0 1073741637)) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,764 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlEXIT(lines 3783 3839) no Hoare annotation was computed. [2018-11-23 02:06:33,765 INFO L448 ceAbstractionStarter]: For program point L3792(lines 3792 3835) no Hoare annotation was computed. [2018-11-23 02:06:33,765 INFO L444 ceAbstractionStarter]: At program point L3790(lines 3789 3836) the Hoare annotation is: (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13))) (and (= 0 ~compRegistered~0) (not (= ~myStatus~0 0)) (= ~routine~0 0) (= ~NP~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,782 INFO L444 ceAbstractionStarter]: At program point CdAudioDeviceControlENTRY(lines 3783 3839) the Hoare annotation is: (or (and (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (not (= ~pended~0 1))) (= ~s~0 |old(~s~0)|)) (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse12 (not (= |old(~compRegistered~0)| 0))) (.cse13 (= 1 ~MPR3~0))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 (+ |old(~myStatus~0)| 1073741637))) .cse13)))) [2018-11-23 02:06:33,782 INFO L448 ceAbstractionStarter]: For program point L3821(line 3821) no Hoare annotation was computed. [2018-11-23 02:06:33,782 INFO L448 ceAbstractionStarter]: For program point CdAudioDeviceControlFINAL(lines 3783 3839) no Hoare annotation was computed. [2018-11-23 02:06:33,782 INFO L448 ceAbstractionStarter]: For program point L3811(line 3811) no Hoare annotation was computed. [2018-11-23 02:06:33,782 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 7745 7757) no Hoare annotation was computed. [2018-11-23 02:06:33,782 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 7745 7757) no Hoare annotation was computed. [2018-11-23 02:06:33,782 INFO L451 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 7745 7757) the Hoare annotation is: true [2018-11-23 02:06:33,782 INFO L448 ceAbstractionStarter]: For program point L7752-1(line 7752) no Hoare annotation was computed. [2018-11-23 02:06:33,782 INFO L451 ceAbstractionStarter]: At program point L7752(line 7752) the Hoare annotation is: true [2018-11-23 02:06:33,782 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:06:33,782 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~UNLOADED~0) (= ~myIrp_PendingReturned~0 0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~compRegistered~0 ~routine~0) (= ~MPR3~0 ~s~0) (not (= ~pended~0 1)) (= ~SKIP1~0 ~s~0)) [2018-11-23 02:06:33,782 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:06:33,782 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:06:33,783 INFO L448 ceAbstractionStarter]: For program point L7071(lines 7071 7078) no Hoare annotation was computed. [2018-11-23 02:06:33,783 INFO L448 ceAbstractionStarter]: For program point L7137(lines 7137 7146) no Hoare annotation was computed. [2018-11-23 02:06:33,795 INFO L448 ceAbstractionStarter]: For program point L6972(lines 6972 6980) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L6774(lines 6774 7263) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L7022(lines 7022 7023) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L6874(lines 6874 6878) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L444 ceAbstractionStarter]: At program point L6775(lines 6774 7263) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L6874-2(lines 6874 6878) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L6792(lines 6792 7257) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L444 ceAbstractionStarter]: At program point L7106(lines 7106 7107) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L7139-1(line 7139) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L444 ceAbstractionStarter]: At program point L7139(line 7139) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L7106-1(lines 7106 7107) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L444 ceAbstractionStarter]: At program point L6842(lines 6842 6843) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlEXIT(lines 6731 7283) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L6842-1(lines 6842 6843) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L7090(lines 7090 7095) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L7123(lines 7123 7136) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L6777(lines 6777 7262) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point CdAudio435DeviceControlFINAL(lines 6731 7283) no Hoare annotation was computed. [2018-11-23 02:06:33,796 INFO L448 ceAbstractionStarter]: For program point L6827(lines 6827 6833) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L7174(lines 7174 7180) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L7240-1(line 7240) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L444 ceAbstractionStarter]: At program point L7240(line 7240) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L7174-2(lines 7170 7181) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L444 ceAbstractionStarter]: At program point L6778(lines 6777 7262) the Hoare annotation is: (or (and (= |old(~myStatus~0)| ~myStatus~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L6795(lines 6795 7256) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L7109(lines 7109 7114) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L6845-1(lines 6845 6861) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L6845(lines 6845 6861) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L7126(lines 7126 7132) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L7027(lines 7027 7032) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L6862(lines 6862 6866) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L448 ceAbstractionStarter]: For program point L6763-1(line 6763) no Hoare annotation was computed. [2018-11-23 02:06:33,809 INFO L444 ceAbstractionStarter]: At program point L6763(line 6763) the Hoare annotation is: (or (and (= |old(~myStatus~0)| ~myStatus~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,810 INFO L444 ceAbstractionStarter]: At program point L6796(lines 6789 7258) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,810 INFO L448 ceAbstractionStarter]: For program point L6862-2(lines 6862 6866) no Hoare annotation was computed. [2018-11-23 02:06:33,810 INFO L448 ceAbstractionStarter]: For program point L6846(lines 6846 6858) no Hoare annotation was computed. [2018-11-23 02:06:33,810 INFO L448 ceAbstractionStarter]: For program point L6780(lines 6780 7261) no Hoare annotation was computed. [2018-11-23 02:06:33,810 INFO L448 ceAbstractionStarter]: For program point L6813-1(line 6813) no Hoare annotation was computed. [2018-11-23 02:06:33,823 INFO L444 ceAbstractionStarter]: At program point L6813(line 6813) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,823 INFO L448 ceAbstractionStarter]: For program point L6847(lines 6847 6855) no Hoare annotation was computed. [2018-11-23 02:06:33,823 INFO L444 ceAbstractionStarter]: At program point L6781(lines 6780 7261) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,823 INFO L448 ceAbstractionStarter]: For program point L6798(lines 6798 7255) no Hoare annotation was computed. [2018-11-23 02:06:33,823 INFO L448 ceAbstractionStarter]: For program point L7211-1(lines 7211 7212) no Hoare annotation was computed. [2018-11-23 02:06:33,823 INFO L444 ceAbstractionStarter]: At program point L7211(lines 7211 7212) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,823 INFO L448 ceAbstractionStarter]: For program point L6765(lines 6765 7266) no Hoare annotation was computed. [2018-11-23 02:06:33,823 INFO L448 ceAbstractionStarter]: For program point L7013(lines 7013 7017) no Hoare annotation was computed. [2018-11-23 02:06:33,823 INFO L448 ceAbstractionStarter]: For program point L6815(lines 6815 6821) no Hoare annotation was computed. [2018-11-23 02:06:33,823 INFO L444 ceAbstractionStarter]: At program point L6881-2(lines 6881 6897) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (not (= CdAudio435DeviceControl_~status~12 259)) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,823 INFO L444 ceAbstractionStarter]: At program point L6898(lines 6803 7251) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (not (= CdAudio435DeviceControl_~status~12 259)) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,823 INFO L444 ceAbstractionStarter]: At program point L6766(lines 6765 7266) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,824 INFO L444 ceAbstractionStarter]: At program point L6799(lines 6798 7255) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,835 INFO L448 ceAbstractionStarter]: For program point L6882(lines 6881 6897) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point L6948(lines 6948 6952) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point L6783(lines 6783 7260) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point L7064-1(line 7064) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L444 ceAbstractionStarter]: At program point L7064(line 7064) the Hoare annotation is: (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point L7279-1(line 7279) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L444 ceAbstractionStarter]: At program point L7279(line 7279) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (not (= CdAudio435DeviceControl_~status~12 259)) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point $Ultimate##26(lines 6803 7253) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point L7147(lines 7147 7157) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point $Ultimate##25(lines 6803 7253) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point L6883(lines 6883 6887) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point L7230(line 7230) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L444 ceAbstractionStarter]: At program point L6784(lines 6783 7260) the Hoare annotation is: (or (and (= |old(~myStatus~0)| ~myStatus~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point L6900-1(lines 6900 6912) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L448 ceAbstractionStarter]: For program point L6933-1(lines 6933 6934) no Hoare annotation was computed. [2018-11-23 02:06:33,836 INFO L444 ceAbstractionStarter]: At program point L6933(lines 6933 6934) the Hoare annotation is: (or (and (not (= ~myStatus~0 0)) (= ~NP~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,853 INFO L448 ceAbstractionStarter]: For program point L7247(line 7247) no Hoare annotation was computed. [2018-11-23 02:06:33,853 INFO L448 ceAbstractionStarter]: For program point L6768(lines 6768 7265) no Hoare annotation was computed. [2018-11-23 02:06:33,853 INFO L448 ceAbstractionStarter]: For program point L7049-1(lines 7049 7050) no Hoare annotation was computed. [2018-11-23 02:06:33,854 INFO L444 ceAbstractionStarter]: At program point L7049(lines 7049 7050) the Hoare annotation is: (or (and (= |old(~myStatus~0)| ~myStatus~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,854 INFO L444 ceAbstractionStarter]: At program point CdAudio435DeviceControlENTRY(lines 6731 7283) the Hoare annotation is: (or (and (= |old(~myStatus~0)| ~myStatus~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,854 INFO L448 ceAbstractionStarter]: For program point L7165-1(lines 7165 7166) no Hoare annotation was computed. [2018-11-23 02:06:33,854 INFO L444 ceAbstractionStarter]: At program point L7165(lines 7165 7166) the Hoare annotation is: (or (and (= |old(~myStatus~0)| ~myStatus~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,854 INFO L448 ceAbstractionStarter]: For program point L7033(lines 7033 7041) no Hoare annotation was computed. [2018-11-23 02:06:33,854 INFO L444 ceAbstractionStarter]: At program point L6802(lines 6801 7254) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,854 INFO L448 ceAbstractionStarter]: For program point L6835-1(line 6835) no Hoare annotation was computed. [2018-11-23 02:06:33,854 INFO L444 ceAbstractionStarter]: At program point L6835(line 6835) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,854 INFO L448 ceAbstractionStarter]: For program point L6786(lines 6786 7259) no Hoare annotation was computed. [2018-11-23 02:06:33,854 INFO L448 ceAbstractionStarter]: For program point L7232(lines 7232 7243) no Hoare annotation was computed. [2018-11-23 02:06:33,868 INFO L448 ceAbstractionStarter]: For program point L7001-1(lines 7001 7002) no Hoare annotation was computed. [2018-11-23 02:06:33,868 INFO L444 ceAbstractionStarter]: At program point L7001(lines 7001 7002) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,869 INFO L444 ceAbstractionStarter]: At program point L7150(line 7150) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,869 INFO L448 ceAbstractionStarter]: For program point L7150-1(line 7150) no Hoare annotation was computed. [2018-11-23 02:06:33,869 INFO L448 ceAbstractionStarter]: For program point L6985(lines 6985 6990) no Hoare annotation was computed. [2018-11-23 02:06:33,869 INFO L444 ceAbstractionStarter]: At program point L6787(lines 6786 7259) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,869 INFO L448 ceAbstractionStarter]: For program point L7068-1(lines 7068 7069) no Hoare annotation was computed. [2018-11-23 02:06:33,869 INFO L444 ceAbstractionStarter]: At program point L7068(lines 7068 7069) the Hoare annotation is: (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) [2018-11-23 02:06:33,869 INFO L448 ceAbstractionStarter]: For program point L6936-2(lines 6936 6947) no Hoare annotation was computed. [2018-11-23 02:06:33,869 INFO L448 ceAbstractionStarter]: For program point L6936(lines 6936 6947) no Hoare annotation was computed. [2018-11-23 02:06:33,869 INFO L448 ceAbstractionStarter]: For program point L6969-1(lines 6969 6970) no Hoare annotation was computed. [2018-11-23 02:06:33,869 INFO L444 ceAbstractionStarter]: At program point L6969(lines 6969 6970) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (not (= ~myStatus~0 0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= ~myStatus~0 |old(~myStatus~0)|) (<= (+ CdAudio435DeviceControl_~status~12 1073741670) 0))) [2018-11-23 02:06:33,869 INFO L448 ceAbstractionStarter]: For program point L6771(lines 6771 7264) no Hoare annotation was computed. [2018-11-23 02:06:33,869 INFO L448 ceAbstractionStarter]: For program point L7052(lines 7052 7059) no Hoare annotation was computed. [2018-11-23 02:06:33,869 INFO L448 ceAbstractionStarter]: For program point L6953(lines 6953 6958) no Hoare annotation was computed. [2018-11-23 02:06:33,869 INFO L448 ceAbstractionStarter]: For program point L7168(lines 7168 7200) no Hoare annotation was computed. [2018-11-23 02:06:33,879 INFO L444 ceAbstractionStarter]: At program point L6772(lines 6768 7265) the Hoare annotation is: (or (and (not (= ~myStatus~0 0)) (= ~NP~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,879 INFO L448 ceAbstractionStarter]: For program point L6805(lines 6805 6811) no Hoare annotation was computed. [2018-11-23 02:06:33,879 INFO L448 ceAbstractionStarter]: For program point L7119-1(lines 7119 7120) no Hoare annotation was computed. [2018-11-23 02:06:33,879 INFO L444 ceAbstractionStarter]: At program point L7119(lines 7119 7120) the Hoare annotation is: (or (and (= |old(~myStatus~0)| ~myStatus~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0))) [2018-11-23 02:06:33,879 INFO L448 ceAbstractionStarter]: For program point L7268-1(lines 7268 7275) no Hoare annotation was computed. [2018-11-23 02:06:33,879 INFO L448 ceAbstractionStarter]: For program point L6789(lines 6789 7258) no Hoare annotation was computed. [2018-11-23 02:06:33,879 INFO L448 ceAbstractionStarter]: For program point L7004(lines 7004 7018) no Hoare annotation was computed. [2018-11-23 02:06:33,879 INFO L444 ceAbstractionStarter]: At program point L7252(lines 6757 7282) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (not (= CdAudio435DeviceControl_~status~12 259)) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,879 INFO L448 ceAbstractionStarter]: For program point L6823-1(lines 6823 6824) no Hoare annotation was computed. [2018-11-23 02:06:33,879 INFO L444 ceAbstractionStarter]: At program point L6823(lines 6823 6824) the Hoare annotation is: (or (or (not (= 7 ~IPC~0)) (< 3 ~SKIP1~0) (< 2 ~DC~0) (not (= ~SKIP2~0 4)) (= 1 |old(~pended~0)|) (= 7 ~MPR3~0) (< ~SKIP1~0 3) (not (= ~myIrp_PendingReturned~0 0)) (not (= 1 ~NP~0)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (not (= ~compRegistered~0 0)) (= 1 ~MPR3~0)) (and (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,879 INFO L448 ceAbstractionStarter]: For program point L7170(lines 7170 7181) no Hoare annotation was computed. [2018-11-23 02:06:33,880 INFO L448 ceAbstractionStarter]: For program point L7451-1(lines 7446 7460) no Hoare annotation was computed. [2018-11-23 02:06:33,880 INFO L448 ceAbstractionStarter]: For program point L7451(lines 7451 7459) no Hoare annotation was computed. [2018-11-23 02:06:33,880 INFO L444 ceAbstractionStarter]: At program point L7453(line 7453) the Hoare annotation is: (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (= 1 ~MPR3~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 (+ ~myStatus~0 1073741637))) .cse12) (< ~MPR1~0 5)) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse11 .cse12))) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,883 INFO L448 ceAbstractionStarter]: For program point L7443-1(line 7443) no Hoare annotation was computed. [2018-11-23 02:06:33,884 INFO L444 ceAbstractionStarter]: At program point L7474(line 7474) the Hoare annotation is: (let ((.cse0 (= 0 ~customIrp~0)) (.cse2 (= 1 ~setEventCalled~0)) (.cse1 (= ~routine~0 1)) (.cse3 (= ~compRegistered~0 1)) (.cse4 (<= 259 CdAudioForwardIrpSynchronous_~status~14)) (.cse5 (not (= ~pended~0 1)))) (or (and (= ~MPR3~0 ~s~0) .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5)) (and .cse0 (and (= ~NP~0 ~s~0) .cse2 .cse1 .cse3 .cse4 .cse5)) (let ((.cse6 (not (= 7 ~IPC~0))) (.cse7 (< 3 ~SKIP1~0)) (.cse8 (< 2 ~DC~0)) (.cse9 (not (= ~SKIP2~0 4))) (.cse10 (= 1 |old(~pended~0)|)) (.cse11 (= 7 ~MPR3~0)) (.cse12 (< ~SKIP1~0 3)) (.cse13 (not (= ~myIrp_PendingReturned~0 0))) (.cse14 (not (= 1 ~NP~0))) (.cse15 (not (= 0 |old(~routine~0)|))) (.cse16 (not (= |old(~s~0)| ~NP~0))) (.cse17 (not (= |old(~compRegistered~0)| 0))) (.cse18 (= 1 ~MPR3~0))) (and (or (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= 0 (+ ~myStatus~0 1073741637))) .cse18) (< ~MPR1~0 5)) (or (not (= ~myStatus~0 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse17 .cse18))) (not (= |old(~customIrp~0)| 0)))) [2018-11-23 02:06:33,884 INFO L444 ceAbstractionStarter]: At program point L7443(line 7443) the Hoare annotation is: (or (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (= 1 ~MPR3~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 (+ ~myStatus~0 1073741637))) .cse12) (< ~MPR1~0 5)) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse11 .cse12))) (not (= |old(~customIrp~0)| 0))) (and (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= 0 ~customIrp~0))) [2018-11-23 02:06:33,884 INFO L448 ceAbstractionStarter]: For program point L7472-2(lines 7472 7480) no Hoare annotation was computed. [2018-11-23 02:06:33,884 INFO L448 ceAbstractionStarter]: For program point L7472(lines 7472 7480) no Hoare annotation was computed. [2018-11-23 02:06:33,884 INFO L448 ceAbstractionStarter]: For program point L7474-1(line 7474) no Hoare annotation was computed. [2018-11-23 02:06:33,884 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousEXIT(lines 7429 7483) no Hoare annotation was computed. [2018-11-23 02:06:33,884 INFO L444 ceAbstractionStarter]: At program point CdAudioForwardIrpSynchronousENTRY(lines 7429 7483) the Hoare annotation is: (or (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (= 1 ~MPR3~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 (+ ~myStatus~0 1073741637))) .cse12) (< ~MPR1~0 5)) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse11 .cse12))) (not (= |old(~customIrp~0)| 0))) (and (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (= 0 ~customIrp~0))) [2018-11-23 02:06:33,892 INFO L448 ceAbstractionStarter]: For program point L7446(lines 7446 7460) no Hoare annotation was computed. [2018-11-23 02:06:33,893 INFO L444 ceAbstractionStarter]: At program point L7448(line 7448) the Hoare annotation is: (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (= 1 ~MPR3~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 (+ ~myStatus~0 1073741637))) .cse12) (< ~MPR1~0 5)) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse11 .cse12))) (not (= |old(~customIrp~0)| 0))) [2018-11-23 02:06:33,893 INFO L448 ceAbstractionStarter]: For program point CdAudioForwardIrpSynchronousFINAL(lines 7429 7483) no Hoare annotation was computed. [2018-11-23 02:06:33,893 INFO L448 ceAbstractionStarter]: For program point L7469-1(line 7469) no Hoare annotation was computed. [2018-11-23 02:06:33,893 INFO L444 ceAbstractionStarter]: At program point L7469(line 7469) the Hoare annotation is: (or (let ((.cse0 (not (= 7 ~IPC~0))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (< 2 ~DC~0)) (.cse3 (not (= ~SKIP2~0 4))) (.cse4 (= 1 |old(~pended~0)|)) (.cse5 (= 7 ~MPR3~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (not (= ~myIrp_PendingReturned~0 0))) (.cse8 (not (= 1 ~NP~0))) (.cse9 (not (= 0 |old(~routine~0)|))) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (not (= |old(~compRegistered~0)| 0))) (.cse12 (= 1 ~MPR3~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 (+ ~myStatus~0 1073741637))) .cse12) (< ~MPR1~0 5)) (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse11 .cse12))) (not (= |old(~customIrp~0)| 0)) (and (= 0 ~customIrp~0) (= ~routine~0 1) (= |old(~s~0)| ~s~0) (= ~compRegistered~0 1) (not (= ~pended~0 1)))) [2018-11-23 02:06:33,893 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 8808 8828) the Hoare annotation is: true [2018-11-23 02:06:33,893 INFO L448 ceAbstractionStarter]: For program point L8823(lines 8808 8828) no Hoare annotation was computed. [2018-11-23 02:06:33,893 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 8808 8828) no Hoare annotation was computed. [2018-11-23 02:06:33,893 INFO L451 ceAbstractionStarter]: At program point L8813(lines 8812 8826) the Hoare annotation is: true [2018-11-23 02:06:33,893 INFO L448 ceAbstractionStarter]: For program point L8812(lines 8812 8826) no Hoare annotation was computed. [2018-11-23 02:06:33,893 INFO L451 ceAbstractionStarter]: At program point L8816(lines 8815 8825) the Hoare annotation is: true [2018-11-23 02:06:33,893 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 8817 8824) no Hoare annotation was computed. [2018-11-23 02:06:33,899 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 8817 8824) no Hoare annotation was computed. [2018-11-23 02:06:33,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:06:33 BoogieIcfgContainer [2018-11-23 02:06:33,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:06:33,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:06:33,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:06:33,973 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:06:33,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:58:15" (3/4) ... [2018-11-23 02:06:33,977 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 02:06:33,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2018-11-23 02:06:33,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-23 02:06:33,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2018-11-23 02:06:33,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 02:06:33,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-23 02:06:33,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-23 02:06:33,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2018-11-23 02:06:33,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoOpenDeviceRegistryKey [2018-11-23 02:06:33,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedIncrement [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure NecSupportNeeded [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memmove [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-23 02:06:33,986 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlCompareMemory [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_malloc [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlWriteRegistryValue [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure MmLockPagableDataSection [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedDecrement [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2018-11-23 02:06:33,987 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2018-11-23 02:06:33,988 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAllocatePoolWithTag [2018-11-23 02:06:33,988 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2018-11-23 02:06:33,988 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2018-11-23 02:06:33,988 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-23 02:06:34,019 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 631 nodes and edges [2018-11-23 02:06:34,024 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 313 nodes and edges [2018-11-23 02:06:34,028 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 143 nodes and edges [2018-11-23 02:06:34,033 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2018-11-23 02:06:34,037 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2018-11-23 02:06:34,041 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-11-23 02:06:34,044 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 02:06:34,076 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && status == lowerDriverReturn) && 4 == s) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2) || !(\old(myStatus) == 0)) || s == UNLOADED) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((((compRegistered == 1 && (((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2) && !(MPR3 == 7)) && DC <= 2) && 7 == IPC) && status == lowerDriverReturn) && IPC == s)) || !(\old(s) == \old(NP))) || (((!(259 == status) && DC <= 2) && 7 == IPC) && DC == s && (((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:06:34,076 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && status == lowerDriverReturn) && 4 == s) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2) || !(\old(myStatus) == 0)) || s == UNLOADED) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((((compRegistered == 1 && (((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2) && !(MPR3 == 7)) && DC <= 2) && 7 == IPC) && status == lowerDriverReturn) && IPC == s)) || !(\old(s) == \old(NP))) || (((!(259 == status) && DC <= 2) && 7 == IPC) && DC == s && (((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:06:34,077 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((((((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && !(DC == 4)) && 4 == SKIP2) && compRegistered == 1) && !(MPR3 == 7)) && DC <= 2) && status == lowerDriverReturn) && 7 == IPC) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((!(259 == status) && DC <= 2) && 7 == IPC) && DC == s && (((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && !(DC == 4)) && 4 == SKIP2)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || ((((((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && 4 == s) && !(DC == 4)) && 4 == SKIP2)) || !(\old(customIrp) == 0) [2018-11-23 02:06:34,077 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((NP == s && 0 == customIrp) || (((((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || !(0 == myStatus + 1073741637)) || 7 == MPR3) && (((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(myStatus == 0)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || 7 == MPR3)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && ((((((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) && (((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637))) || !(\old(customIrp) == 0)) || ((NP == s && 1 == setEventCalled) && 0 == customIrp))) && (0 == customIrp || (((((((((((((((1 == MPR3 || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == myStatus + 1073741637)) && ((((((((((((((1 == MPR3 || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0))) || !(\old(customIrp) == 0))) && ((((((((((((((NP == s || 1 == MPR3) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) [2018-11-23 02:06:34,077 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((NP == s && 0 == customIrp) || (((((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || !(0 == myStatus + 1073741637)) || 7 == MPR3) && (((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(myStatus == 0)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || 7 == MPR3)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && ((((((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) && (((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637))) || !(\old(customIrp) == 0)) || ((NP == s && 1 == setEventCalled) && 0 == customIrp))) && (0 == customIrp || (((((((((((((((1 == MPR3 || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == myStatus + 1073741637)) && ((((((((((((((1 == MPR3 || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0))) || !(\old(customIrp) == 0))) && ((((((((((((((NP == s || 1 == MPR3) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) [2018-11-23 02:06:34,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((3 < SKIP1 || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 4 == DC) || !(compRegistered == 0)) || (!(pended == 1) && SKIP1 == s)) || 1 == MPR3 [2018-11-23 02:06:34,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || (((((((((((((0 == compRegistered && DC <= 2) && 7 == IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && !(MPR3 == 7)) && 0 == myStatus) && NP == s) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(pended == 1)) && 4 == SKIP2)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((((((((((((0 == compRegistered && DC <= 2) && 7 == IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && !(MPR3 == 7)) && NP == s) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && 0 == myStatus + 1073741637) && !(pended == 1)) && 4 == SKIP2)) || !(\old(customIrp) == 0) [2018-11-23 02:06:34,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((3 < SKIP1 || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 4 == DC) || !(compRegistered == 0)) || (!(pended == 1) && SKIP1 == s)) || 1 == MPR3 [2018-11-23 02:06:34,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((3 < SKIP1 || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 4 == DC) || !(compRegistered == 0)) || (!(pended == 1) && SKIP1 == s)) || 1 == MPR3 [2018-11-23 02:06:34,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((3 < SKIP1 || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 4 == DC) || !(compRegistered == 0)) || (!(pended == 1) && SKIP1 == s)) || 1 == MPR3 [2018-11-23 02:06:34,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || (NP == s && !(pended == 1))) || 1 == MPR3) && (((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && MPR1 == s) && !(pended == 1)) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || !(customIrp == 0))) && (((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || (NP == s && !(pended == 1))) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) && (((((((((((((((!(pended == 1) && SKIP1 == s) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) [2018-11-23 02:06:34,078 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP == s && !(pended == 1)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3) && (((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && MPR1 == s) && !(pended == 1)) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || !(customIrp == 0))) && (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || (NP == s && !(pended == 1))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3)) && (((((((((((((((!(pended == 1) && SKIP1 == s) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) [2018-11-23 02:06:34,079 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((((((0 == compRegistered && DC <= 2) && 7 == IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && !(MPR3 == 7)) && 0 == myStatus) && NP == s) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(pended == 1)) && 4 == SKIP2) || (((((((((((((0 == compRegistered && DC <= 2) && 7 == IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && !(MPR3 == 7)) && NP == s) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && 0 == myStatus + 1073741637) && !(pended == 1)) && 4 == SKIP2)) && 0 == customIrp)) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:06:34,079 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP == s && !(pended == 1)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3) && (((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && MPR1 == s) && !(pended == 1)) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || !(customIrp == 0))) && (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || (NP == s && !(pended == 1))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3)) && (((((((((((((((!(pended == 1) && SKIP1 == s) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) [2018-11-23 02:06:34,079 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((NP == s && !(pended == 1)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3) && (((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && MPR1 == s) && !(pended == 1)) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || !(customIrp == 0))) && (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || (NP == s && !(pended == 1))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3)) && (((((((((((((((!(pended == 1) && SKIP1 == s) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) [2018-11-23 02:06:34,079 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(\old(myStatus) == 0) || (((((((((0 == compRegistered && SKIP1 + 2 <= MPR1) && NP == s) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:06:34,080 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || ((((((((((DC <= 2 && 7 == IPC) && SKIP1 + 2 <= MPR1) && DC == s) && !(259 == status)) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(pended == 1)) && 4 == SKIP2)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || ((((((((((((DC <= 2 && 7 == IPC) && SKIP1 + 2 <= MPR1) && status == lowerDriverReturn) && IPC == s) && compRegistered == 1) && !(MPR3 == 7)) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(pended == 1)) && 4 == SKIP2)) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((((((SKIP1 + 2 <= MPR1 && status == lowerDriverReturn) && s == SKIP2) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-23 02:06:34,080 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((IPC == s && compRegistered == 1) && routine == 0) && 0 == myStatus + 1073741637) && !(pended == 1)) && lowerDriverReturn == status) || ((((s == SKIP2 && routine == 0) && 0 == myStatus + 1073741637) && !(pended == 1)) && lowerDriverReturn == status)) || (((!(259 == status) && DC == s) && routine == 0) && !(pended == 1))) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) [2018-11-23 02:06:34,081 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || (((((0 == compRegistered && !(myStatus == 0)) && routine == 0) && NP == s) && myStatus == \old(myStatus)) && !(pended == 1)) [2018-11-23 02:06:34,082 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0 == myStatus + 1073741637) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3))) || !(\old(customIrp) == 0)) && (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || ((((0 == customIrp && NP == s) && routine == 1) && compRegistered == 1) && !(pended == 1))) || !(\old(customIrp) == 0)) [2018-11-23 02:06:34,082 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (!(status == 259) && NP == s && !(pended == 1)) [2018-11-23 02:06:34,082 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,082 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0 == myStatus + 1073741637) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3))) || !(\old(customIrp) == 0)) && (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || ((((0 == customIrp && NP == s) && routine == 1) && compRegistered == 1) && !(pended == 1))) || !(\old(customIrp) == 0)) [2018-11-23 02:06:34,083 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || ((!(status == 259) && NP == s) && !(pended == 1)) [2018-11-23 02:06:34,083 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((1 == MPR3 || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || NP == s) && ((0 == customIrp && 1 == setEventCalled && \old(s) == s) || ((((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) && (((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637))) || !(\old(customIrp) == 0))) && (0 == customIrp || (((((((((((((((1 == MPR3 || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == myStatus + 1073741637)) && ((((((((((((((1 == MPR3 || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0))) || !(\old(customIrp) == 0))) && ((((((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || !(0 == myStatus + 1073741637)) || 7 == MPR3) && (((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(myStatus == 0)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || 7 == MPR3)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) [2018-11-23 02:06:34,083 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && NP == s) && !(pended == 1)) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) [2018-11-23 02:06:34,084 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == compRegistered && routine == 0) && NP == s) && 0 == myStatus + 1073741637) && !(pended == 1)) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) [2018-11-23 02:06:34,101 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == compRegistered && \old(myStatus) == myStatus) && 0 == customIrp) && routine == 0) && 0 == myStatus) && \old(s) == s) && !(259 == status)) && !(pended == 1)) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || !(\old(customIrp) == 0) [2018-11-23 02:06:34,101 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == compRegistered && routine == 0) && NP == s) && 0 == myStatus + 1073741637) && !(pended == 1)) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) [2018-11-23 02:06:34,101 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || ((((0 == compRegistered && routine == 0) && NP == s) && 0 == myStatus + 1073741637) && !(pended == 1)) [2018-11-23 02:06:34,102 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || !(\old(customIrp) == 0)) || ((0 == customIrp && ((0 == compRegistered && routine == 0) && NP == s) && !(pended == 1)) && (\old(myStatus) == status || status + 1073741637 == 0))) && (\old(myStatus) == myStatus || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || !(\old(customIrp) == 0)) [2018-11-23 02:06:34,120 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == compRegistered && routine == 0) && NP == s) && !(pended == 1)) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || !(\old(customIrp) == 0) [2018-11-23 02:06:34,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (NP == s && !(pended == 1)) [2018-11-23 02:06:34,121 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (NP == s && !(pended == 1)) [2018-11-23 02:06:34,122 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (NP == s && !(pended == 1)) [2018-11-23 02:06:34,122 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(myStatus == 0) && NP == s) && myStatus == \old(myStatus)) && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,140 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || ((NP == s && myStatus == \old(myStatus)) && !(pended == 1)) [2018-11-23 02:06:34,141 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0 == myStatus + 1073741637) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3))) || !(\old(customIrp) == 0)) && (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || ((((0 == customIrp && NP == s) && routine == 1) && compRegistered == 1) && !(pended == 1))) || !(\old(customIrp) == 0)) [2018-11-23 02:06:34,141 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,141 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,142 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0 == myStatus + 1073741637) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3))) || !(\old(customIrp) == 0)) && (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || ((((0 == customIrp && NP == s) && routine == 1) && compRegistered == 1) && !(pended == 1))) || !(\old(customIrp) == 0)) [2018-11-23 02:06:34,155 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,155 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(myStatus) == myStatus && NP == s) && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,155 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(0 == myStatus + 1073741637) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3))) || !(\old(customIrp) == 0)) && (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || ((((0 == customIrp && NP == s) && routine == 1) && compRegistered == 1) && !(pended == 1))) || !(\old(customIrp) == 0)) [2018-11-23 02:06:34,156 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,173 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,174 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (NP == s && !(pended == 1)) [2018-11-23 02:06:34,174 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\old(myStatus) == myStatus && NP == s) && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,174 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,174 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,175 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (NP == s && !(pended == 1)) [2018-11-23 02:06:34,175 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(status == 259) && 0 <= status + 1073741789) && NP == s) && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,175 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || ((!(status == 259) && NP == s) && !(pended == 1)) [2018-11-23 02:06:34,175 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(status == 259) && 0 <= status + 1073741789) && NP == s) && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,213 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || ((!(status == 259) && NP == s) && !(pended == 1)) [2018-11-23 02:06:34,214 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,214 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,214 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 [2018-11-23 02:06:34,376 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2f0ee409-1735-4738-9976-ae0a2bec1587/bin-2019/uautomizer/witness.graphml [2018-11-23 02:06:34,376 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:06:34,376 INFO L168 Benchmark]: Toolchain (without parser) took 535517.00 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 649.1 MB). Free memory was 943.0 MB in the beginning and 1.3 GB in the end (delta: -404.0 MB). Peak memory consumption was 245.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:06:34,377 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:06:34,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1567.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 943.0 MB in the beginning and 976.0 MB in the end (delta: -32.9 MB). Peak memory consumption was 185.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:06:34,377 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.30 ms. Allocated memory is still 1.2 GB. Free memory was 976.0 MB in the beginning and 969.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:06:34,378 INFO L168 Benchmark]: Boogie Preprocessor took 173.01 ms. Allocated memory is still 1.2 GB. Free memory was 969.2 MB in the beginning and 932.1 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-11-23 02:06:34,378 INFO L168 Benchmark]: RCFGBuilder took 34770.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 932.1 MB in the beginning and 1.2 GB in the end (delta: -274.5 MB). Peak memory consumption was 280.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:06:34,378 INFO L168 Benchmark]: TraceAbstraction took 498513.66 ms. Allocated memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: 261.6 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -219.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-23 02:06:34,378 INFO L168 Benchmark]: Witness Printer took 402.83 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 78.9 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:06:34,380 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1567.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 943.0 MB in the beginning and 976.0 MB in the end (delta: -32.9 MB). Peak memory consumption was 185.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.30 ms. Allocated memory is still 1.2 GB. Free memory was 976.0 MB in the beginning and 969.2 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 173.01 ms. Allocated memory is still 1.2 GB. Free memory was 969.2 MB in the beginning and 932.1 MB in the end (delta: 37.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 34770.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 932.1 MB in the beginning and 1.2 GB in the end (delta: -274.5 MB). Peak memory consumption was 280.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 498513.66 ms. Allocated memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: 261.6 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -219.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 402.83 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 78.9 MB). Peak memory consumption was 78.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2845]: 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: 8382]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == MPR3 || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || NP == s) && ((0 == customIrp && 1 == setEventCalled && \old(s) == s) || ((((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) && (((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637))) || !(\old(customIrp) == 0))) && (0 == customIrp || (((((((((((((((1 == MPR3 || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == myStatus + 1073741637)) && ((((((((((((((1 == MPR3 || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0))) || !(\old(customIrp) == 0))) && ((((((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || !(0 == myStatus + 1073741637)) || 7 == MPR3) && (((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(myStatus == 0)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || 7 == MPR3)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 3448]: Loop Invariant Derived loop invariant: ((!(0 == myStatus + 1073741637) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3))) || !(\old(customIrp) == 0)) && (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || ((((0 == customIrp && NP == s) && routine == 1) && compRegistered == 1) && !(pended == 1))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 3798]: Loop Invariant Derived loop invariant: ((((0 == compRegistered && routine == 0) && NP == s) && 0 == myStatus + 1073741637) && !(pended == 1)) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) - InvariantResult [Line: 6786]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 7639]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && status == lowerDriverReturn) && 4 == s) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2) || !(\old(myStatus) == 0)) || s == UNLOADED) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((((compRegistered == 1 && (((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2) && !(MPR3 == 7)) && DC <= 2) && 7 == IPC) && status == lowerDriverReturn) && IPC == s)) || !(\old(s) == \old(NP))) || (((!(259 == status) && DC <= 2) && 7 == IPC) && DC == s && (((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 3619]: Loop Invariant Derived loop invariant: (((((((0 == compRegistered && \old(myStatus) == myStatus) && 0 == customIrp) && routine == 0) && 0 == myStatus) && \old(s) == s) && !(259 == status)) && !(pended == 1)) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || !(\old(customIrp) == 0) - InvariantResult [Line: 6314]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 8576]: Loop Invariant Derived loop invariant: ((((((((((3 < SKIP1 || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 4 == DC) || !(compRegistered == 0)) || (!(pended == 1) && SKIP1 == s)) || 1 == MPR3 - InvariantResult [Line: 6311]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 8573]: Loop Invariant Derived loop invariant: ((((((((((3 < SKIP1 || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 4 == DC) || !(compRegistered == 0)) || (!(pended == 1) && SKIP1 == s)) || 1 == MPR3 - InvariantResult [Line: 6801]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 3226]: Loop Invariant Derived loop invariant: ((!(0 == myStatus + 1073741637) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3))) || !(\old(customIrp) == 0)) && (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || ((((0 == customIrp && NP == s) && routine == 1) && compRegistered == 1) && !(pended == 1))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 6329]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 6757]: Loop Invariant Derived loop invariant: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || ((!(status == 259) && NP == s) && !(pended == 1)) - InvariantResult [Line: 3622]: Loop Invariant Derived loop invariant: (((((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || !(\old(customIrp) == 0)) || ((0 == customIrp && ((0 == compRegistered && routine == 0) && NP == s) && !(pended == 1)) && (\old(myStatus) == status || status + 1073741637 == 0))) && (\old(myStatus) == myStatus || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 3795]: Loop Invariant Derived loop invariant: ((((0 == compRegistered && routine == 0) && NP == s) && 0 == myStatus + 1073741637) && !(pended == 1)) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) - InvariantResult [Line: 8404]: Loop Invariant Derived loop invariant: ((((NP == s && 0 == customIrp) || (((((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || !(0 == myStatus + 1073741637)) || 7 == MPR3) && (((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(myStatus == 0)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || 7 == MPR3)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && ((((((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) && (((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637))) || !(\old(customIrp) == 0)) || ((NP == s && 1 == setEventCalled) && 0 == customIrp))) && (0 == customIrp || (((((((((((((((1 == MPR3 || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == myStatus + 1073741637)) && ((((((((((((((1 == MPR3 || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0))) || !(\old(customIrp) == 0))) && ((((((((((((((NP == s || 1 == MPR3) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) - InvariantResult [Line: 6783]: Loop Invariant Derived loop invariant: ((\old(myStatus) == myStatus && NP == s) && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 7569]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || ((((((((((DC <= 2 && 7 == IPC) && SKIP1 + 2 <= MPR1) && DC == s) && !(259 == status)) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(pended == 1)) && 4 == SKIP2)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || ((((((((((((DC <= 2 && 7 == IPC) && SKIP1 + 2 <= MPR1) && status == lowerDriverReturn) && IPC == s) && compRegistered == 1) && !(MPR3 == 7)) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(pended == 1)) && 4 == SKIP2)) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((((((SKIP1 + 2 <= MPR1 && status == lowerDriverReturn) && s == SKIP2) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 6479]: Loop Invariant Derived loop invariant: (((!(status == 259) && 0 <= status + 1073741789) && NP == s) && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 6317]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 6302]: Loop Invariant Derived loop invariant: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (NP == s && !(pended == 1)) - InvariantResult [Line: 6765]: Loop Invariant Derived loop invariant: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (NP == s && !(pended == 1)) - InvariantResult [Line: 7593]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || (((((((((((((0 == compRegistered && DC <= 2) && 7 == IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && !(MPR3 == 7)) && 0 == myStatus) && NP == s) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(pended == 1)) && 4 == SKIP2)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((((((((((((0 == compRegistered && DC <= 2) && 7 == IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && !(MPR3 == 7)) && NP == s) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && 0 == myStatus + 1073741637) && !(pended == 1)) && 4 == SKIP2)) || !(\old(customIrp) == 0) - InvariantResult [Line: 6798]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 8219]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP == s && !(pended == 1)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3) && (((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && MPR1 == s) && !(pended == 1)) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || !(customIrp == 0))) && (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || (NP == s && !(pended == 1))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3)) && (((((((((((((((!(pended == 1) && SKIP1 == s) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) - InvariantResult [Line: 7596]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((((((0 == compRegistered && DC <= 2) && 7 == IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && !(MPR3 == 7)) && 0 == myStatus) && NP == s) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(pended == 1)) && 4 == SKIP2) || (((((((((((((0 == compRegistered && DC <= 2) && 7 == IPC) && SKIP1 + 2 <= MPR1) && routine == 0) && !(MPR3 == 7)) && NP == s) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && 0 == myStatus + 1073741637) && !(pended == 1)) && 4 == SKIP2)) && 0 == customIrp)) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 6803]: Loop Invariant Derived loop invariant: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || ((!(status == 259) && NP == s) && !(pended == 1)) - InvariantResult [Line: 3792]: Loop Invariant Derived loop invariant: ((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && NP == s) && !(pended == 1)) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) - InvariantResult [Line: 8189]: Loop Invariant Derived loop invariant: (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || (NP == s && !(pended == 1))) || 1 == MPR3) && (((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && MPR1 == s) && !(pended == 1)) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || !(customIrp == 0))) && (((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || (NP == s && !(pended == 1))) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) && (((((((((((((((!(pended == 1) && SKIP1 == s) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) - InvariantResult [Line: 6780]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 7661]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || ((((((((((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && !(DC == 4)) && 4 == SKIP2) && compRegistered == 1) && !(MPR3 == 7)) && DC <= 2) && status == lowerDriverReturn) && 7 == IPC) && IPC == s)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((!(259 == status) && DC <= 2) && 7 == IPC) && DC == s && (((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && !(DC == 4)) && 4 == SKIP2)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || ((((((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && 4 == s) && !(DC == 4)) && 4 == SKIP2)) || !(\old(customIrp) == 0) - InvariantResult [Line: 6305]: Loop Invariant Derived loop invariant: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (NP == s && !(pended == 1)) - InvariantResult [Line: 3210]: Loop Invariant Derived loop invariant: ((!(0 == myStatus + 1073741637) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3))) || !(\old(customIrp) == 0)) && (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || ((((0 == customIrp && NP == s) && routine == 1) && compRegistered == 1) && !(pended == 1))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 6789]: Loop Invariant Derived loop invariant: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (NP == s && !(pended == 1)) - InvariantResult [Line: 3803]: Loop Invariant Derived loop invariant: (((((((IPC == s && compRegistered == 1) && routine == 0) && 0 == myStatus + 1073741637) && !(pended == 1)) && lowerDriverReturn == status) || ((((s == SKIP2 && routine == 0) && 0 == myStatus + 1073741637) && !(pended == 1)) && lowerDriverReturn == status)) || (((!(259 == status) && DC == s) && routine == 0) && !(pended == 1))) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) - InvariantResult [Line: 8222]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP == s && !(pended == 1)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3) && (((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && MPR1 == s) && !(pended == 1)) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || !(customIrp == 0))) && (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || (NP == s && !(pended == 1))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3)) && (((((((((((((((!(pended == 1) && SKIP1 == s) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) - InvariantResult [Line: 6334]: Loop Invariant Derived loop invariant: (((!(status == 259) && 0 <= status + 1073741789) && NP == s) && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 3789]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || (((((0 == compRegistered && !(myStatus == 0)) && routine == 0) && NP == s) && myStatus == \old(myStatus)) && !(pended == 1)) - InvariantResult [Line: 3489]: Loop Invariant Derived loop invariant: ((!(0 == myStatus + 1073741637) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3))) || !(\old(customIrp) == 0)) && (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || ((((0 == customIrp && NP == s) && routine == 1) && compRegistered == 1) && !(pended == 1))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 6294]: Loop Invariant Derived loop invariant: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (!(status == 259) && NP == s && !(pended == 1)) - InvariantResult [Line: 6777]: Loop Invariant Derived loop invariant: ((\old(myStatus) == myStatus && NP == s) && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 6332]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7599]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(myStatus) == 0) || (((((((((0 == compRegistered && SKIP1 + 2 <= MPR1) && NP == s) && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 8225]: Loop Invariant Derived loop invariant: ((((((((((((((((((NP == s && !(pended == 1)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3) && (((((compRetStatus + 1073741802 <= 0 && 0 <= compRetStatus + 1073741802) && 1 == setEventCalled) && MPR1 == s) && !(pended == 1)) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || !(customIrp == 0))) && (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || (NP == s && !(pended == 1))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || 1 == MPR3)) && (((((((((((((((!(pended == 1) && SKIP1 == s) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) - InvariantResult [Line: 6881]: Loop Invariant Derived loop invariant: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || ((!(status == 259) && NP == s) && !(pended == 1)) - InvariantResult [Line: 6609]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 6320]: Loop Invariant Derived loop invariant: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || (NP == s && !(pended == 1)) - InvariantResult [Line: 8812]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6774]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 8543]: Loop Invariant Derived loop invariant: ((((((((((3 < SKIP1 || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 4 == DC) || !(compRegistered == 0)) || (!(pended == 1) && SKIP1 == s)) || 1 == MPR3 - InvariantResult [Line: 7647]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && status == lowerDriverReturn) && 4 == s) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2) || !(\old(myStatus) == 0)) || s == UNLOADED) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(myIrp_PendingReturned == 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((((compRegistered == 1 && (((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2) && !(MPR3 == 7)) && DC <= 2) && 7 == IPC) && status == lowerDriverReturn) && IPC == s)) || !(\old(s) == \old(NP))) || (((!(259 == status) && DC <= 2) && 7 == IPC) && DC == s && (((((((myIrp_PendingReturned == 0 && !(MPR3 == 1)) && SKIP1 <= 3) && 3 <= SKIP1) && 1 == NP) && SKIP1 + 2 <= MPR1) && !(DC == 4)) && !(pended == 1)) && 4 == SKIP2)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 3365]: Loop Invariant Derived loop invariant: ((!(0 == myStatus + 1073741637) || (((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3))) || !(\old(customIrp) == 0)) && (((((((((((((((((!(myStatus == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == myStatus + 1073741637)) || 1 == MPR3)) || ((((0 == customIrp && NP == s) && routine == 1) && compRegistered == 1) && !(pended == 1))) || !(\old(customIrp) == 0)) - InvariantResult [Line: 7602]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3801]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || ((((0 == compRegistered && routine == 0) && NP == s) && 0 == myStatus + 1073741637) && !(pended == 1)) - InvariantResult [Line: 3625]: Loop Invariant Derived loop invariant: (((0 == compRegistered && routine == 0) && NP == s) && !(pended == 1)) || (((((((((((((((!(\old(myStatus) == 0) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || 1 == MPR3) && ((((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == \old(routine))) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(\old(compRegistered) == 0)) || !(0 == \old(myStatus) + 1073741637)) || 1 == MPR3)) || !(\old(customIrp) == 0) - InvariantResult [Line: 8407]: Loop Invariant Derived loop invariant: ((((NP == s && 0 == customIrp) || (((((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || !(0 == myStatus + 1073741637)) || 7 == MPR3) && (((((!(\old(setEventCalled) == 1) || !(7 == IPC)) || !(myStatus == 0)) || !(SKIP2 == 4) || (((((((!(myIrp_PendingReturned == 0) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 3 < SKIP1) || 1 == pended) || !(compRegistered == routine)) || SKIP1 < 3) || !(1 == routine)) || 1 == MPR3) || 2 < DC) || 7 == MPR3)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) && ((((((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) && (((((((((((((((!(\old(setEventCalled) == 1) || 1 == MPR3) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(1 == routine)) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 1)) || !(0 == myStatus + 1073741637))) || !(\old(customIrp) == 0)) || ((NP == s && 1 == setEventCalled) && 0 == customIrp))) && (0 == customIrp || (((((((((((((((1 == MPR3 || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || !(0 == myStatus + 1073741637)) && ((((((((((((((1 == MPR3 || !(myStatus == 0)) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0))) || !(\old(customIrp) == 0))) && ((((((((((((((NP == s || 1 == MPR3) || !(7 == IPC)) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == pended) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) - InvariantResult [Line: 8815]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6308]: Loop Invariant Derived loop invariant: (((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3) || ((NP == s && myStatus == \old(myStatus)) && !(pended == 1)) - InvariantResult [Line: 6768]: Loop Invariant Derived loop invariant: (((!(myStatus == 0) && NP == s) && myStatus == \old(myStatus)) && !(pended == 1)) || ((((((((((((!(7 == IPC) || 3 < SKIP1) || 2 < DC) || !(SKIP2 == 4)) || 1 == \old(pended)) || 7 == MPR3) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || !(compRegistered == 0)) || 1 == MPR3 - InvariantResult [Line: 8570]: Loop Invariant Derived loop invariant: ((((((((((3 < SKIP1 || !(SKIP2 == 4)) || 1 == \old(pended)) || !(SKIP1 == \old(s))) || SKIP1 < 3) || !(myIrp_PendingReturned == 0)) || !(1 == NP)) || MPR1 < SKIP1 + 2) || 4 == DC) || !(compRegistered == 0)) || (!(pended == 1) && SKIP1 == s)) || 1 == MPR3 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 39 procedures, 689 locations, 1 error locations. SAFE Result, 498.3s OverallTime, 76 OverallIterations, 4 TraceHistogramMax, 429.8s AutomataDifference, 0.0s DeadEndRemovalTime, 51.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 57300 SDtfs, 30587 SDslu, 207157 SDs, 0 SdLazy, 28060 SolverSat, 5328 SolverUnsat, 189 SolverUnknown, 0 SolverNotchecked, 417.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1198 GetRequests, 632 SyntacticMatches, 4 SemanticMatches, 562 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2182occurred in iteration=22, 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: 5.5s AutomataMinimizationTime, 76 MinimizatonAttempts, 5327 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 218 LocationsWithAnnotation, 4531 PreInvPairs, 4879 NumberOfFragments, 28955 HoareAnnotationTreeSize, 4531 FomulaSimplifications, 26172736 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 218 FomulaSimplificationsInter, 4259798 FormulaSimplificationTreeSizeReductionInter, 48.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 5948 NumberOfCodeBlocks, 5946 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 5867 ConstructedInterpolants, 0 QuantifiedInterpolants, 819188 SizeOfPredicates, 4 NumberOfNonLiveVariables, 7780 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 81 InterpolantComputations, 73 PerfectInterpolantSequences, 178/195 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...