java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 13:01:32,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 13:01:32,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 13:01:32,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 13:01:32,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 13:01:32,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 13:01:32,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 13:01:32,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 13:01:32,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 13:01:32,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 13:01:32,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 13:01:32,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 13:01:32,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 13:01:32,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 13:01:32,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 13:01:32,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 13:01:32,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 13:01:32,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 13:01:32,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 13:01:32,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 13:01:32,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 13:01:32,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 13:01:32,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 13:01:32,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 13:01:32,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 13:01:32,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 13:01:32,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 13:01:32,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 13:01:32,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 13:01:32,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 13:01:32,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 13:01:32,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 13:01:32,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 13:01:32,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 13:01:32,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 13:01:32,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 13:01:32,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 13:01:32,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 13:01:32,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 13:01:32,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 13:01:32,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 13:01:32,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 13:01:32,702 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 13:01:32,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 13:01:32,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 13:01:32,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 13:01:32,705 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 13:01:32,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 13:01:32,705 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 13:01:32,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 13:01:32,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 13:01:32,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 13:01:32,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 13:01:32,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 13:01:32,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 13:01:32,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 13:01:32,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 13:01:32,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 13:01:32,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 13:01:32,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 13:01:32,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 13:01:32,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 13:01:32,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 13:01:32,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 13:01:32,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 13:01:32,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 13:01:32,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 13:01:32,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 13:01:32,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 13:01:32,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 13:01:32,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 13:01:32,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 13:01:32,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 13:01:32,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 13:01:32,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 13:01:32,780 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 13:01:32,781 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-09-07 13:01:32,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6aaf44ec/20f973370a084f1f901d9e6a45aceb9d/FLAG95dec7000 [2019-09-07 13:01:33,405 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 13:01:33,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-09-07 13:01:33,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6aaf44ec/20f973370a084f1f901d9e6a45aceb9d/FLAG95dec7000 [2019-09-07 13:01:33,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6aaf44ec/20f973370a084f1f901d9e6a45aceb9d [2019-09-07 13:01:33,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 13:01:33,748 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 13:01:33,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 13:01:33,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 13:01:33,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 13:01:33,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:01:33" (1/1) ... [2019-09-07 13:01:33,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e86496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:33, skipping insertion in model container [2019-09-07 13:01:33,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 01:01:33" (1/1) ... [2019-09-07 13:01:33,765 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 13:01:33,821 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 13:01:34,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:01:34,354 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 13:01:34,482 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 13:01:34,520 INFO L192 MainTranslator]: Completed translation [2019-09-07 13:01:34,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:34 WrapperNode [2019-09-07 13:01:34,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 13:01:34,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 13:01:34,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 13:01:34,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 13:01:34,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:34" (1/1) ... [2019-09-07 13:01:34,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:34" (1/1) ... [2019-09-07 13:01:34,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:34" (1/1) ... [2019-09-07 13:01:34,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:34" (1/1) ... [2019-09-07 13:01:34,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:34" (1/1) ... [2019-09-07 13:01:34,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:34" (1/1) ... [2019-09-07 13:01:34,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:34" (1/1) ... [2019-09-07 13:01:34,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 13:01:34,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 13:01:34,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 13:01:34,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 13:01:34,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-07 13:01:34,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 13:01:34,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 13:01:34,710 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-07 13:01:34,710 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-09-07 13:01:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-09-07 13:01:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-09-07 13:01:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-09-07 13:01:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-09-07 13:01:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-09-07 13:01:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-09-07 13:01:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-07 13:01:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 13:01:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-07 13:01:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-09-07 13:01:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-09-07 13:01:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-09-07 13:01:34,713 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-09-07 13:01:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-07 13:01:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-07 13:01:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-07 13:01:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-07 13:01:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-07 13:01:34,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-09-07 13:01:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-09-07 13:01:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-09-07 13:01:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-09-07 13:01:34,715 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-09-07 13:01:34,716 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-09-07 13:01:34,716 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-09-07 13:01:34,716 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-07 13:01:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 13:01:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-07 13:01:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 13:01:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-07 13:01:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-07 13:01:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-09-07 13:01:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-09-07 13:01:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-09-07 13:01:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-09-07 13:01:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-09-07 13:01:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-09-07 13:01:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-07 13:01:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-09-07 13:01:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-09-07 13:01:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-09-07 13:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-09-07 13:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-07 13:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-07 13:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-07 13:01:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-09-07 13:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-09-07 13:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-09-07 13:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-09-07 13:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-09-07 13:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-09-07 13:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-09-07 13:01:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-07 13:01:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-07 13:01:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-07 13:01:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-09-07 13:01:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-07 13:01:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 13:01:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-07 13:01:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 13:01:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 13:01:35,076 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:35,140 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:01:35,140 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:01:35,162 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:35,196 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:01:35,196 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:01:35,205 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:35,450 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-09-07 13:01:35,450 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-09-07 13:01:35,453 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:35,608 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-09-07 13:01:35,608 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-09-07 13:01:35,625 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:35,651 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-07 13:01:35,652 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-07 13:01:35,775 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:35,786 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:01:35,786 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:01:35,787 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:35,795 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:01:35,796 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:01:35,796 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:35,810 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:01:35,811 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:01:35,894 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:35,933 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-07 13:01:35,933 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-07 13:01:35,936 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:36,080 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-09-07 13:01:36,080 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-09-07 13:01:36,142 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:36,150 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:01:36,150 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:01:36,150 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:36,158 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:01:36,158 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:01:36,159 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-07 13:01:36,166 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-07 13:01:36,166 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-07 13:01:36,177 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 13:01:36,177 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 13:01:36,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:01:36 BoogieIcfgContainer [2019-09-07 13:01:36,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 13:01:36,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 13:01:36,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 13:01:36,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 13:01:36,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 01:01:33" (1/3) ... [2019-09-07 13:01:36,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776b5f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:01:36, skipping insertion in model container [2019-09-07 13:01:36,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 01:01:34" (2/3) ... [2019-09-07 13:01:36,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776b5f68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 01:01:36, skipping insertion in model container [2019-09-07 13:01:36,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 01:01:36" (3/3) ... [2019-09-07 13:01:36,187 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-09-07 13:01:36,197 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 13:01:36,206 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 13:01:36,223 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 13:01:36,272 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 13:01:36,273 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 13:01:36,273 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 13:01:36,273 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 13:01:36,275 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 13:01:36,275 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 13:01:36,276 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 13:01:36,276 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 13:01:36,276 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 13:01:36,307 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states. [2019-09-07 13:01:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 13:01:36,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:36,315 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:36,318 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:36,324 INFO L82 PathProgramCache]: Analyzing trace with hash 513471565, now seen corresponding path program 1 times [2019-09-07 13:01:36,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:36,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:36,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:36,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:36,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:36,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:36,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:36,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:36,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:36,614 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 3 states. [2019-09-07 13:01:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:36,762 INFO L93 Difference]: Finished difference Result 624 states and 909 transitions. [2019-09-07 13:01:36,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:36,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 13:01:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:36,796 INFO L225 Difference]: With dead ends: 624 [2019-09-07 13:01:36,796 INFO L226 Difference]: Without dead ends: 380 [2019-09-07 13:01:36,812 INFO L628 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 [2019-09-07 13:01:36,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-07 13:01:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-09-07 13:01:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-07 13:01:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2019-09-07 13:01:36,902 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2019-09-07 13:01:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:36,903 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2019-09-07 13:01:36,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2019-09-07 13:01:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 13:01:36,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:36,905 INFO L399 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] [2019-09-07 13:01:36,905 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2120474792, now seen corresponding path program 1 times [2019-09-07 13:01:36,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:36,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:36,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:36,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:37,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:37,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:37,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:37,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:37,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:37,103 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand 3 states. [2019-09-07 13:01:37,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:37,342 INFO L93 Difference]: Finished difference Result 699 states and 950 transitions. [2019-09-07 13:01:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:37,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-07 13:01:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:37,349 INFO L225 Difference]: With dead ends: 699 [2019-09-07 13:01:37,350 INFO L226 Difference]: Without dead ends: 536 [2019-09-07 13:01:37,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-07 13:01:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2019-09-07 13:01:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-09-07 13:01:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 706 transitions. [2019-09-07 13:01:37,443 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 706 transitions. Word has length 25 [2019-09-07 13:01:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:37,443 INFO L475 AbstractCegarLoop]: Abstraction has 519 states and 706 transitions. [2019-09-07 13:01:37,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:37,444 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 706 transitions. [2019-09-07 13:01:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 13:01:37,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:37,447 INFO L399 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] [2019-09-07 13:01:37,447 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:37,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:37,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1525052010, now seen corresponding path program 1 times [2019-09-07 13:01:37,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:37,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:37,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:37,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:37,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:37,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:37,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:37,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:37,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:37,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:37,697 INFO L87 Difference]: Start difference. First operand 519 states and 706 transitions. Second operand 3 states. [2019-09-07 13:01:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:37,768 INFO L93 Difference]: Finished difference Result 642 states and 859 transitions. [2019-09-07 13:01:37,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:37,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-07 13:01:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:37,777 INFO L225 Difference]: With dead ends: 642 [2019-09-07 13:01:37,777 INFO L226 Difference]: Without dead ends: 623 [2019-09-07 13:01:37,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-07 13:01:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 577. [2019-09-07 13:01:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-07 13:01:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 780 transitions. [2019-09-07 13:01:37,827 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 780 transitions. Word has length 31 [2019-09-07 13:01:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:37,827 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 780 transitions. [2019-09-07 13:01:37,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 780 transitions. [2019-09-07 13:01:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-07 13:01:37,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:37,836 INFO L399 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] [2019-09-07 13:01:37,836 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1803096900, now seen corresponding path program 1 times [2019-09-07 13:01:37,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:37,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:37,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:37,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:37,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:37,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:37,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:37,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:37,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:37,954 INFO L87 Difference]: Start difference. First operand 577 states and 780 transitions. Second operand 3 states. [2019-09-07 13:01:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:38,026 INFO L93 Difference]: Finished difference Result 1080 states and 1455 transitions. [2019-09-07 13:01:38,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:38,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-07 13:01:38,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:38,035 INFO L225 Difference]: With dead ends: 1080 [2019-09-07 13:01:38,035 INFO L226 Difference]: Without dead ends: 788 [2019-09-07 13:01:38,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-07 13:01:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2019-09-07 13:01:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-07 13:01:38,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1030 transitions. [2019-09-07 13:01:38,104 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1030 transitions. Word has length 33 [2019-09-07 13:01:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:38,105 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1030 transitions. [2019-09-07 13:01:38,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:38,108 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1030 transitions. [2019-09-07 13:01:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 13:01:38,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:38,113 INFO L399 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] [2019-09-07 13:01:38,113 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:38,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1275107652, now seen corresponding path program 1 times [2019-09-07 13:01:38,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:38,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:38,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:38,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:38,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:38,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:38,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:38,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:38,168 INFO L87 Difference]: Start difference. First operand 759 states and 1030 transitions. Second operand 3 states. [2019-09-07 13:01:38,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:38,274 INFO L93 Difference]: Finished difference Result 795 states and 1072 transitions. [2019-09-07 13:01:38,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:38,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-07 13:01:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:38,281 INFO L225 Difference]: With dead ends: 795 [2019-09-07 13:01:38,282 INFO L226 Difference]: Without dead ends: 790 [2019-09-07 13:01:38,283 INFO L628 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 [2019-09-07 13:01:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-09-07 13:01:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-09-07 13:01:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-09-07 13:01:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1065 transitions. [2019-09-07 13:01:38,331 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1065 transitions. Word has length 39 [2019-09-07 13:01:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:38,334 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 1065 transitions. [2019-09-07 13:01:38,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1065 transitions. [2019-09-07 13:01:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-07 13:01:38,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:38,336 INFO L399 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] [2019-09-07 13:01:38,336 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:38,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1074736541, now seen corresponding path program 1 times [2019-09-07 13:01:38,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:38,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:38,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:38,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:38,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:38,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:38,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:38,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:38,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:38,419 INFO L87 Difference]: Start difference. First operand 788 states and 1065 transitions. Second operand 3 states. [2019-09-07 13:01:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:38,536 INFO L93 Difference]: Finished difference Result 803 states and 1085 transitions. [2019-09-07 13:01:38,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:38,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-09-07 13:01:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:38,542 INFO L225 Difference]: With dead ends: 803 [2019-09-07 13:01:38,542 INFO L226 Difference]: Without dead ends: 800 [2019-09-07 13:01:38,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-09-07 13:01:38,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 799. [2019-09-07 13:01:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-09-07 13:01:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1079 transitions. [2019-09-07 13:01:38,581 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1079 transitions. Word has length 38 [2019-09-07 13:01:38,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:38,582 INFO L475 AbstractCegarLoop]: Abstraction has 799 states and 1079 transitions. [2019-09-07 13:01:38,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1079 transitions. [2019-09-07 13:01:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 13:01:38,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:38,584 INFO L399 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] [2019-09-07 13:01:38,584 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:38,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1033738490, now seen corresponding path program 1 times [2019-09-07 13:01:38,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:38,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:38,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:38,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:38,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:38,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:38,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:38,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:38,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:38,633 INFO L87 Difference]: Start difference. First operand 799 states and 1079 transitions. Second operand 5 states. [2019-09-07 13:01:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:38,721 INFO L93 Difference]: Finished difference Result 812 states and 1093 transitions. [2019-09-07 13:01:38,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:38,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-09-07 13:01:38,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:38,727 INFO L225 Difference]: With dead ends: 812 [2019-09-07 13:01:38,727 INFO L226 Difference]: Without dead ends: 797 [2019-09-07 13:01:38,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-09-07 13:01:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-09-07 13:01:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-09-07 13:01:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1075 transitions. [2019-09-07 13:01:38,767 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1075 transitions. Word has length 39 [2019-09-07 13:01:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:38,767 INFO L475 AbstractCegarLoop]: Abstraction has 797 states and 1075 transitions. [2019-09-07 13:01:38,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1075 transitions. [2019-09-07 13:01:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 13:01:38,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:38,769 INFO L399 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] [2019-09-07 13:01:38,769 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:38,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:38,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1325280387, now seen corresponding path program 1 times [2019-09-07 13:01:38,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:38,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:38,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:38,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:38,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:38,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:38,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:38,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:38,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:38,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:38,817 INFO L87 Difference]: Start difference. First operand 797 states and 1075 transitions. Second operand 5 states. [2019-09-07 13:01:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:38,879 INFO L93 Difference]: Finished difference Result 810 states and 1089 transitions. [2019-09-07 13:01:38,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:38,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-09-07 13:01:38,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:38,885 INFO L225 Difference]: With dead ends: 810 [2019-09-07 13:01:38,885 INFO L226 Difference]: Without dead ends: 790 [2019-09-07 13:01:38,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-09-07 13:01:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-09-07 13:01:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-09-07 13:01:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-09-07 13:01:38,922 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 40 [2019-09-07 13:01:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:38,922 INFO L475 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-09-07 13:01:38,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-09-07 13:01:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 13:01:38,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:38,924 INFO L399 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] [2019-09-07 13:01:38,925 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:38,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1677893832, now seen corresponding path program 1 times [2019-09-07 13:01:38,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:38,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:38,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:38,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:38,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:38,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:38,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:38,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:38,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:38,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:38,971 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-09-07 13:01:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:39,117 INFO L93 Difference]: Finished difference Result 1168 states and 1590 transitions. [2019-09-07 13:01:39,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:39,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-07 13:01:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:39,125 INFO L225 Difference]: With dead ends: 1168 [2019-09-07 13:01:39,126 INFO L226 Difference]: Without dead ends: 1165 [2019-09-07 13:01:39,127 INFO L628 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 [2019-09-07 13:01:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-09-07 13:01:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 913. [2019-09-07 13:01:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-09-07 13:01:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1235 transitions. [2019-09-07 13:01:39,189 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1235 transitions. Word has length 44 [2019-09-07 13:01:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:39,190 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1235 transitions. [2019-09-07 13:01:39,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1235 transitions. [2019-09-07 13:01:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 13:01:39,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:39,191 INFO L399 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] [2019-09-07 13:01:39,192 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:39,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2097381887, now seen corresponding path program 1 times [2019-09-07 13:01:39,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:39,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:39,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:39,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:39,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:39,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:39,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:39,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:39,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:39,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:39,299 INFO L87 Difference]: Start difference. First operand 913 states and 1235 transitions. Second operand 5 states. [2019-09-07 13:01:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:39,722 INFO L93 Difference]: Finished difference Result 921 states and 1241 transitions. [2019-09-07 13:01:39,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:39,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-09-07 13:01:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:39,737 INFO L225 Difference]: With dead ends: 921 [2019-09-07 13:01:39,737 INFO L226 Difference]: Without dead ends: 915 [2019-09-07 13:01:39,738 INFO L628 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 [2019-09-07 13:01:39,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-07 13:01:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2019-09-07 13:01:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-09-07 13:01:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1234 transitions. [2019-09-07 13:01:39,799 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1234 transitions. Word has length 43 [2019-09-07 13:01:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:39,799 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1234 transitions. [2019-09-07 13:01:39,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1234 transitions. [2019-09-07 13:01:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 13:01:39,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:39,803 INFO L399 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] [2019-09-07 13:01:39,804 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash 667497540, now seen corresponding path program 1 times [2019-09-07 13:01:39,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:39,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:39,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:39,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:39,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:39,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:39,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:01:39,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:01:39,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:01:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:01:39,871 INFO L87 Difference]: Start difference. First operand 913 states and 1234 transitions. Second operand 4 states. [2019-09-07 13:01:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:39,979 INFO L93 Difference]: Finished difference Result 941 states and 1267 transitions. [2019-09-07 13:01:39,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:01:39,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-09-07 13:01:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:39,991 INFO L225 Difference]: With dead ends: 941 [2019-09-07 13:01:39,992 INFO L226 Difference]: Without dead ends: 919 [2019-09-07 13:01:39,996 INFO L628 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 [2019-09-07 13:01:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-07 13:01:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 915. [2019-09-07 13:01:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-09-07 13:01:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1236 transitions. [2019-09-07 13:01:40,054 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1236 transitions. Word has length 42 [2019-09-07 13:01:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:40,057 INFO L475 AbstractCegarLoop]: Abstraction has 915 states and 1236 transitions. [2019-09-07 13:01:40,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:01:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1236 transitions. [2019-09-07 13:01:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 13:01:40,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:40,059 INFO L399 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] [2019-09-07 13:01:40,059 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:40,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash 237043572, now seen corresponding path program 1 times [2019-09-07 13:01:40,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:40,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:40,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:40,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:40,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:40,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:40,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:40,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:40,195 INFO L87 Difference]: Start difference. First operand 915 states and 1236 transitions. Second operand 5 states. [2019-09-07 13:01:41,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:41,063 INFO L93 Difference]: Finished difference Result 1639 states and 2184 transitions. [2019-09-07 13:01:41,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:01:41,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-07 13:01:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:41,100 INFO L225 Difference]: With dead ends: 1639 [2019-09-07 13:01:41,100 INFO L226 Difference]: Without dead ends: 1088 [2019-09-07 13:01:41,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-07 13:01:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 906. [2019-09-07 13:01:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-07 13:01:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1215 transitions. [2019-09-07 13:01:41,150 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1215 transitions. Word has length 45 [2019-09-07 13:01:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:41,151 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1215 transitions. [2019-09-07 13:01:41,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1215 transitions. [2019-09-07 13:01:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 13:01:41,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:41,153 INFO L399 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] [2019-09-07 13:01:41,153 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:41,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:41,153 INFO L82 PathProgramCache]: Analyzing trace with hash -266291307, now seen corresponding path program 1 times [2019-09-07 13:01:41,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:41,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:41,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:41,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:41,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:41,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:41,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:41,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:41,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:41,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:41,209 INFO L87 Difference]: Start difference. First operand 906 states and 1215 transitions. Second operand 5 states. [2019-09-07 13:01:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:41,602 INFO L93 Difference]: Finished difference Result 914 states and 1221 transitions. [2019-09-07 13:01:41,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:41,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-09-07 13:01:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:41,608 INFO L225 Difference]: With dead ends: 914 [2019-09-07 13:01:41,609 INFO L226 Difference]: Without dead ends: 908 [2019-09-07 13:01:41,610 INFO L628 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 [2019-09-07 13:01:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-09-07 13:01:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 906. [2019-09-07 13:01:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-07 13:01:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-09-07 13:01:41,659 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 44 [2019-09-07 13:01:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:41,660 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-09-07 13:01:41,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-09-07 13:01:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 13:01:41,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:41,662 INFO L399 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] [2019-09-07 13:01:41,662 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:41,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:41,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2124566473, now seen corresponding path program 1 times [2019-09-07 13:01:41,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:41,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:41,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:41,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:41,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:41,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:41,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:41,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:01:41,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:01:41,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:01:41,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:01:41,722 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 4 states. [2019-09-07 13:01:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:41,840 INFO L93 Difference]: Finished difference Result 934 states and 1247 transitions. [2019-09-07 13:01:41,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:01:41,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-09-07 13:01:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:41,848 INFO L225 Difference]: With dead ends: 934 [2019-09-07 13:01:41,848 INFO L226 Difference]: Without dead ends: 912 [2019-09-07 13:01:41,851 INFO L628 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 [2019-09-07 13:01:41,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-07 13:01:41,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 906. [2019-09-07 13:01:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-09-07 13:01:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-09-07 13:01:41,919 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 43 [2019-09-07 13:01:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:41,919 INFO L475 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-09-07 13:01:41,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:01:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-09-07 13:01:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-07 13:01:41,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:41,922 INFO L399 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] [2019-09-07 13:01:41,922 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:41,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:41,923 INFO L82 PathProgramCache]: Analyzing trace with hash 418451048, now seen corresponding path program 1 times [2019-09-07 13:01:41,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:41,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:41,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:41,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:41,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:42,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:42,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:42,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:42,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:42,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:42,011 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 5 states. [2019-09-07 13:01:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:42,106 INFO L93 Difference]: Finished difference Result 922 states and 1229 transitions. [2019-09-07 13:01:42,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:42,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-09-07 13:01:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:42,114 INFO L225 Difference]: With dead ends: 922 [2019-09-07 13:01:42,114 INFO L226 Difference]: Without dead ends: 904 [2019-09-07 13:01:42,118 INFO L628 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 [2019-09-07 13:01:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-09-07 13:01:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2019-09-07 13:01:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-07 13:01:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2019-09-07 13:01:42,214 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 45 [2019-09-07 13:01:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:42,214 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2019-09-07 13:01:42,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2019-09-07 13:01:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 13:01:42,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:42,217 INFO L399 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] [2019-09-07 13:01:42,217 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:42,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1008250026, now seen corresponding path program 1 times [2019-09-07 13:01:42,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:42,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:42,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:42,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:42,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:42,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:42,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:42,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:42,312 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand 3 states. [2019-09-07 13:01:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:42,361 INFO L93 Difference]: Finished difference Result 944 states and 1257 transitions. [2019-09-07 13:01:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:42,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-07 13:01:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:42,367 INFO L225 Difference]: With dead ends: 944 [2019-09-07 13:01:42,367 INFO L226 Difference]: Without dead ends: 868 [2019-09-07 13:01:42,368 INFO L628 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 [2019-09-07 13:01:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-09-07 13:01:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2019-09-07 13:01:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-09-07 13:01:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2019-09-07 13:01:42,417 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 46 [2019-09-07 13:01:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:42,418 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2019-09-07 13:01:42,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2019-09-07 13:01:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 13:01:42,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:42,420 INFO L399 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] [2019-09-07 13:01:42,420 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:42,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1391552118, now seen corresponding path program 1 times [2019-09-07 13:01:42,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:42,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:42,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:42,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:42,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:42,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:42,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:42,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:42,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:42,474 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand 5 states. [2019-09-07 13:01:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:42,524 INFO L93 Difference]: Finished difference Result 881 states and 1174 transitions. [2019-09-07 13:01:42,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:42,524 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-09-07 13:01:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:42,530 INFO L225 Difference]: With dead ends: 881 [2019-09-07 13:01:42,530 INFO L226 Difference]: Without dead ends: 863 [2019-09-07 13:01:42,531 INFO L628 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 [2019-09-07 13:01:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-07 13:01:42,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-09-07 13:01:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-09-07 13:01:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1155 transitions. [2019-09-07 13:01:42,575 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1155 transitions. Word has length 47 [2019-09-07 13:01:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:42,575 INFO L475 AbstractCegarLoop]: Abstraction has 863 states and 1155 transitions. [2019-09-07 13:01:42,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1155 transitions. [2019-09-07 13:01:42,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 13:01:42,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:42,578 INFO L399 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] [2019-09-07 13:01:42,578 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash 868426094, now seen corresponding path program 1 times [2019-09-07 13:01:42,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:42,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:42,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:42,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:42,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:42,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:42,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:01:42,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:01:42,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:01:42,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:01:42,627 INFO L87 Difference]: Start difference. First operand 863 states and 1155 transitions. Second operand 4 states. [2019-09-07 13:01:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:42,859 INFO L93 Difference]: Finished difference Result 947 states and 1238 transitions. [2019-09-07 13:01:42,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:01:42,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-09-07 13:01:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:42,864 INFO L225 Difference]: With dead ends: 947 [2019-09-07 13:01:42,864 INFO L226 Difference]: Without dead ends: 614 [2019-09-07 13:01:42,865 INFO L628 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 [2019-09-07 13:01:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-07 13:01:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 577. [2019-09-07 13:01:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-07 13:01:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 748 transitions. [2019-09-07 13:01:42,896 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 748 transitions. Word has length 52 [2019-09-07 13:01:42,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:42,896 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 748 transitions. [2019-09-07 13:01:42,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:01:42,896 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 748 transitions. [2019-09-07 13:01:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 13:01:42,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:42,898 INFO L399 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] [2019-09-07 13:01:42,898 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:42,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1378147806, now seen corresponding path program 1 times [2019-09-07 13:01:42,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:42,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:42,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:42,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:42,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:42,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:42,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:01:42,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:01:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:01:42,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:42,957 INFO L87 Difference]: Start difference. First operand 577 states and 748 transitions. Second operand 6 states. [2019-09-07 13:01:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:43,051 INFO L93 Difference]: Finished difference Result 597 states and 768 transitions. [2019-09-07 13:01:43,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:01:43,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-09-07 13:01:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:43,056 INFO L225 Difference]: With dead ends: 597 [2019-09-07 13:01:43,056 INFO L226 Difference]: Without dead ends: 577 [2019-09-07 13:01:43,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-07 13:01:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-09-07 13:01:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-07 13:01:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 736 transitions. [2019-09-07 13:01:43,093 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 736 transitions. Word has length 50 [2019-09-07 13:01:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:43,093 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 736 transitions. [2019-09-07 13:01:43,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:01:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 736 transitions. [2019-09-07 13:01:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 13:01:43,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:43,095 INFO L399 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] [2019-09-07 13:01:43,096 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:43,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:43,096 INFO L82 PathProgramCache]: Analyzing trace with hash 994153444, now seen corresponding path program 1 times [2019-09-07 13:01:43,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:43,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:43,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:43,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:43,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:43,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:43,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:43,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:43,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:43,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:43,147 INFO L87 Difference]: Start difference. First operand 577 states and 736 transitions. Second operand 3 states. [2019-09-07 13:01:43,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:43,288 INFO L93 Difference]: Finished difference Result 779 states and 1004 transitions. [2019-09-07 13:01:43,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:43,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-07 13:01:43,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:43,293 INFO L225 Difference]: With dead ends: 779 [2019-09-07 13:01:43,294 INFO L226 Difference]: Without dead ends: 752 [2019-09-07 13:01:43,295 INFO L628 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 [2019-09-07 13:01:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-07 13:01:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 622. [2019-09-07 13:01:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-07 13:01:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 793 transitions. [2019-09-07 13:01:43,358 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 793 transitions. Word has length 50 [2019-09-07 13:01:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:43,358 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 793 transitions. [2019-09-07 13:01:43,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:43,359 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 793 transitions. [2019-09-07 13:01:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 13:01:43,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:43,360 INFO L399 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] [2019-09-07 13:01:43,360 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:43,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:43,361 INFO L82 PathProgramCache]: Analyzing trace with hash -12540829, now seen corresponding path program 1 times [2019-09-07 13:01:43,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:43,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:43,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:43,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:43,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:43,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:43,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:01:43,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:01:43,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:01:43,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:43,420 INFO L87 Difference]: Start difference. First operand 622 states and 793 transitions. Second operand 7 states. [2019-09-07 13:01:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:43,541 INFO L93 Difference]: Finished difference Result 661 states and 836 transitions. [2019-09-07 13:01:43,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:01:43,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-07 13:01:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:43,545 INFO L225 Difference]: With dead ends: 661 [2019-09-07 13:01:43,546 INFO L226 Difference]: Without dead ends: 612 [2019-09-07 13:01:43,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:01:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-07 13:01:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-09-07 13:01:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-07 13:01:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2019-09-07 13:01:43,579 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 51 [2019-09-07 13:01:43,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:43,580 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2019-09-07 13:01:43,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:01:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2019-09-07 13:01:43,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 13:01:43,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:43,582 INFO L399 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] [2019-09-07 13:01:43,582 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:43,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:43,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1421151086, now seen corresponding path program 1 times [2019-09-07 13:01:43,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:43,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:43,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:43,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:43,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:43,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:01:43,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:01:43,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:01:43,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:43,649 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 6 states. [2019-09-07 13:01:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:43,703 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2019-09-07 13:01:43,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:01:43,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-09-07 13:01:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:43,707 INFO L225 Difference]: With dead ends: 637 [2019-09-07 13:01:43,707 INFO L226 Difference]: Without dead ends: 612 [2019-09-07 13:01:43,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-07 13:01:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-07 13:01:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-07 13:01:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2019-09-07 13:01:43,762 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2019-09-07 13:01:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:43,763 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2019-09-07 13:01:43,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:01:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2019-09-07 13:01:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 13:01:43,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:43,768 INFO L399 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] [2019-09-07 13:01:43,768 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:43,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:43,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1205911361, now seen corresponding path program 1 times [2019-09-07 13:01:43,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:43,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:43,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:43,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:01:43,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:01:43,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:01:43,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:01:43,869 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 8 states. [2019-09-07 13:01:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:44,068 INFO L93 Difference]: Finished difference Result 642 states and 810 transitions. [2019-09-07 13:01:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:01:44,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-07 13:01:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:44,073 INFO L225 Difference]: With dead ends: 642 [2019-09-07 13:01:44,073 INFO L226 Difference]: Without dead ends: 638 [2019-09-07 13:01:44,074 INFO L628 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 [2019-09-07 13:01:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-07 13:01:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2019-09-07 13:01:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-07 13:01:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 797 transitions. [2019-09-07 13:01:44,120 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 797 transitions. Word has length 51 [2019-09-07 13:01:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:44,121 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 797 transitions. [2019-09-07 13:01:44,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:01:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 797 transitions. [2019-09-07 13:01:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 13:01:44,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:44,123 INFO L399 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] [2019-09-07 13:01:44,123 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:44,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1205634531, now seen corresponding path program 1 times [2019-09-07 13:01:44,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:44,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:44,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:44,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:44,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:44,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:44,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:01:44,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:01:44,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:01:44,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:01:44,216 INFO L87 Difference]: Start difference. First operand 630 states and 797 transitions. Second operand 8 states. [2019-09-07 13:01:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:44,345 INFO L93 Difference]: Finished difference Result 1024 states and 1318 transitions. [2019-09-07 13:01:44,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:01:44,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-07 13:01:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:44,351 INFO L225 Difference]: With dead ends: 1024 [2019-09-07 13:01:44,351 INFO L226 Difference]: Without dead ends: 670 [2019-09-07 13:01:44,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:01:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-07 13:01:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2019-09-07 13:01:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-07 13:01:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 835 transitions. [2019-09-07 13:01:44,403 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 835 transitions. Word has length 51 [2019-09-07 13:01:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:44,403 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 835 transitions. [2019-09-07 13:01:44,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:01:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 835 transitions. [2019-09-07 13:01:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 13:01:44,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:44,406 INFO L399 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] [2019-09-07 13:01:44,407 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:44,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1316245040, now seen corresponding path program 1 times [2019-09-07 13:01:44,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:44,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:44,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:44,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:44,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:44,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:44,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:44,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:44,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:44,473 INFO L87 Difference]: Start difference. First operand 651 states and 835 transitions. Second operand 5 states. [2019-09-07 13:01:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:45,046 INFO L93 Difference]: Finished difference Result 796 states and 1033 transitions. [2019-09-07 13:01:45,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:45,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-07 13:01:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:45,051 INFO L225 Difference]: With dead ends: 796 [2019-09-07 13:01:45,051 INFO L226 Difference]: Without dead ends: 786 [2019-09-07 13:01:45,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-07 13:01:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 651. [2019-09-07 13:01:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-07 13:01:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 833 transitions. [2019-09-07 13:01:45,092 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 833 transitions. Word has length 52 [2019-09-07 13:01:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:45,092 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 833 transitions. [2019-09-07 13:01:45,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 833 transitions. [2019-09-07 13:01:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 13:01:45,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:45,094 INFO L399 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] [2019-09-07 13:01:45,095 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:45,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:45,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1499440053, now seen corresponding path program 1 times [2019-09-07 13:01:45,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:45,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:45,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:45,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:45,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:45,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:45,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:01:45,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:01:45,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:01:45,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:45,162 INFO L87 Difference]: Start difference. First operand 651 states and 833 transitions. Second operand 7 states. [2019-09-07 13:01:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:46,039 INFO L93 Difference]: Finished difference Result 805 states and 1030 transitions. [2019-09-07 13:01:46,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:01:46,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-09-07 13:01:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:46,044 INFO L225 Difference]: With dead ends: 805 [2019-09-07 13:01:46,044 INFO L226 Difference]: Without dead ends: 708 [2019-09-07 13:01:46,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:01:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-07 13:01:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 680. [2019-09-07 13:01:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-07 13:01:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 871 transitions. [2019-09-07 13:01:46,087 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 871 transitions. Word has length 52 [2019-09-07 13:01:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:46,087 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 871 transitions. [2019-09-07 13:01:46,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:01:46,088 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 871 transitions. [2019-09-07 13:01:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-07 13:01:46,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:46,089 INFO L399 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] [2019-09-07 13:01:46,090 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1356160695, now seen corresponding path program 1 times [2019-09-07 13:01:46,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:46,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:46,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:46,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:46,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:46,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:46,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:46,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:46,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:46,130 INFO L87 Difference]: Start difference. First operand 680 states and 871 transitions. Second operand 3 states. [2019-09-07 13:01:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:46,265 INFO L93 Difference]: Finished difference Result 838 states and 1089 transitions. [2019-09-07 13:01:46,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:46,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-09-07 13:01:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:46,270 INFO L225 Difference]: With dead ends: 838 [2019-09-07 13:01:46,271 INFO L226 Difference]: Without dead ends: 765 [2019-09-07 13:01:46,272 INFO L628 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 [2019-09-07 13:01:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-09-07 13:01:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 653. [2019-09-07 13:01:46,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-07 13:01:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 850 transitions. [2019-09-07 13:01:46,326 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 850 transitions. Word has length 52 [2019-09-07 13:01:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:46,328 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 850 transitions. [2019-09-07 13:01:46,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:46,328 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 850 transitions. [2019-09-07 13:01:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 13:01:46,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:46,331 INFO L399 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] [2019-09-07 13:01:46,331 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:46,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1285456356, now seen corresponding path program 1 times [2019-09-07 13:01:46,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:46,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:46,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:46,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:46,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:46,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:46,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:46,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:46,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:46,393 INFO L87 Difference]: Start difference. First operand 653 states and 850 transitions. Second operand 5 states. [2019-09-07 13:01:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:46,940 INFO L93 Difference]: Finished difference Result 792 states and 1046 transitions. [2019-09-07 13:01:46,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:46,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-07 13:01:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:46,945 INFO L225 Difference]: With dead ends: 792 [2019-09-07 13:01:46,945 INFO L226 Difference]: Without dead ends: 776 [2019-09-07 13:01:46,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-09-07 13:01:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 642. [2019-09-07 13:01:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-07 13:01:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 832 transitions. [2019-09-07 13:01:46,986 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 832 transitions. Word has length 53 [2019-09-07 13:01:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:46,987 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 832 transitions. [2019-09-07 13:01:46,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 832 transitions. [2019-09-07 13:01:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 13:01:46,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:46,989 INFO L399 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] [2019-09-07 13:01:46,989 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:46,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1526640246, now seen corresponding path program 1 times [2019-09-07 13:01:46,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:46,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:46,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:46,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:46,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:47,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:47,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:47,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:47,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:47,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:47,045 INFO L87 Difference]: Start difference. First operand 642 states and 832 transitions. Second operand 3 states. [2019-09-07 13:01:47,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:47,122 INFO L93 Difference]: Finished difference Result 959 states and 1249 transitions. [2019-09-07 13:01:47,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:47,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-07 13:01:47,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:47,126 INFO L225 Difference]: With dead ends: 959 [2019-09-07 13:01:47,127 INFO L226 Difference]: Without dead ends: 642 [2019-09-07 13:01:47,130 INFO L628 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 [2019-09-07 13:01:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-07 13:01:47,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-09-07 13:01:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-07 13:01:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 830 transitions. [2019-09-07 13:01:47,171 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 830 transitions. Word has length 58 [2019-09-07 13:01:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:47,171 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 830 transitions. [2019-09-07 13:01:47,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 830 transitions. [2019-09-07 13:01:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 13:01:47,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:47,173 INFO L399 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] [2019-09-07 13:01:47,173 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash 195627467, now seen corresponding path program 1 times [2019-09-07 13:01:47,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:47,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:47,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:47,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:47,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:47,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:47,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:47,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:47,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:47,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:47,237 INFO L87 Difference]: Start difference. First operand 642 states and 830 transitions. Second operand 5 states. [2019-09-07 13:01:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:47,686 INFO L93 Difference]: Finished difference Result 724 states and 933 transitions. [2019-09-07 13:01:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:47,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-07 13:01:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:47,690 INFO L225 Difference]: With dead ends: 724 [2019-09-07 13:01:47,691 INFO L226 Difference]: Without dead ends: 706 [2019-09-07 13:01:47,692 INFO L628 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 [2019-09-07 13:01:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-09-07 13:01:47,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 641. [2019-09-07 13:01:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-07 13:01:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 827 transitions. [2019-09-07 13:01:47,736 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 827 transitions. Word has length 54 [2019-09-07 13:01:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:47,736 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 827 transitions. [2019-09-07 13:01:47,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 827 transitions. [2019-09-07 13:01:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 13:01:47,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:47,740 INFO L399 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] [2019-09-07 13:01:47,741 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -848857517, now seen corresponding path program 1 times [2019-09-07 13:01:47,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:47,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:47,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:47,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:47,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:47,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:47,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:01:47,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:01:47,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:01:47,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:01:47,802 INFO L87 Difference]: Start difference. First operand 641 states and 827 transitions. Second operand 4 states. [2019-09-07 13:01:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:48,224 INFO L93 Difference]: Finished difference Result 1353 states and 1727 transitions. [2019-09-07 13:01:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:01:48,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-09-07 13:01:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:48,231 INFO L225 Difference]: With dead ends: 1353 [2019-09-07 13:01:48,231 INFO L226 Difference]: Without dead ends: 1211 [2019-09-07 13:01:48,232 INFO L628 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 [2019-09-07 13:01:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2019-09-07 13:01:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1142. [2019-09-07 13:01:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-09-07 13:01:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1489 transitions. [2019-09-07 13:01:48,307 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1489 transitions. Word has length 55 [2019-09-07 13:01:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:48,307 INFO L475 AbstractCegarLoop]: Abstraction has 1142 states and 1489 transitions. [2019-09-07 13:01:48,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:01:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1489 transitions. [2019-09-07 13:01:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-07 13:01:48,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:48,314 INFO L399 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] [2019-09-07 13:01:48,315 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:48,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:48,315 INFO L82 PathProgramCache]: Analyzing trace with hash -426155691, now seen corresponding path program 1 times [2019-09-07 13:01:48,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:48,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:48,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:48,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:48,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:48,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:48,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:01:48,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:01:48,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:01:48,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:01:48,391 INFO L87 Difference]: Start difference. First operand 1142 states and 1489 transitions. Second operand 8 states. [2019-09-07 13:01:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:48,516 INFO L93 Difference]: Finished difference Result 1155 states and 1501 transitions. [2019-09-07 13:01:48,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:01:48,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-09-07 13:01:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:48,523 INFO L225 Difference]: With dead ends: 1155 [2019-09-07 13:01:48,524 INFO L226 Difference]: Without dead ends: 1123 [2019-09-07 13:01:48,526 INFO L628 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 [2019-09-07 13:01:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-09-07 13:01:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-09-07 13:01:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-09-07 13:01:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1465 transitions. [2019-09-07 13:01:48,638 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1465 transitions. Word has length 55 [2019-09-07 13:01:48,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:48,638 INFO L475 AbstractCegarLoop]: Abstraction has 1123 states and 1465 transitions. [2019-09-07 13:01:48,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:01:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1465 transitions. [2019-09-07 13:01:48,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-07 13:01:48,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:48,642 INFO L399 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] [2019-09-07 13:01:48,643 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:48,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:48,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1988865588, now seen corresponding path program 1 times [2019-09-07 13:01:48,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:48,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:48,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:48,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:48,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:48,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:48,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:48,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:48,797 INFO L87 Difference]: Start difference. First operand 1123 states and 1465 transitions. Second operand 5 states. [2019-09-07 13:01:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:48,872 INFO L93 Difference]: Finished difference Result 1659 states and 2175 transitions. [2019-09-07 13:01:48,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:48,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-07 13:01:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:48,889 INFO L225 Difference]: With dead ends: 1659 [2019-09-07 13:01:48,890 INFO L226 Difference]: Without dead ends: 1008 [2019-09-07 13:01:48,893 INFO L628 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 [2019-09-07 13:01:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-09-07 13:01:48,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 958. [2019-09-07 13:01:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-09-07 13:01:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1214 transitions. [2019-09-07 13:01:48,965 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1214 transitions. Word has length 64 [2019-09-07 13:01:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:48,966 INFO L475 AbstractCegarLoop]: Abstraction has 958 states and 1214 transitions. [2019-09-07 13:01:48,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1214 transitions. [2019-09-07 13:01:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 13:01:48,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:48,968 INFO L399 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] [2019-09-07 13:01:48,969 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1192768520, now seen corresponding path program 1 times [2019-09-07 13:01:48,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:48,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:48,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:48,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:48,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:49,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:49,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:01:49,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:01:49,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:01:49,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:01:49,052 INFO L87 Difference]: Start difference. First operand 958 states and 1214 transitions. Second operand 8 states. [2019-09-07 13:01:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:49,247 INFO L93 Difference]: Finished difference Result 981 states and 1236 transitions. [2019-09-07 13:01:49,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:01:49,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-09-07 13:01:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:49,252 INFO L225 Difference]: With dead ends: 981 [2019-09-07 13:01:49,252 INFO L226 Difference]: Without dead ends: 950 [2019-09-07 13:01:49,254 INFO L628 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 [2019-09-07 13:01:49,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-09-07 13:01:49,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-09-07 13:01:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-09-07 13:01:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1200 transitions. [2019-09-07 13:01:49,328 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1200 transitions. Word has length 57 [2019-09-07 13:01:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:49,328 INFO L475 AbstractCegarLoop]: Abstraction has 950 states and 1200 transitions. [2019-09-07 13:01:49,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:01:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1200 transitions. [2019-09-07 13:01:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 13:01:49,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:49,334 INFO L399 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] [2019-09-07 13:01:49,334 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1272632321, now seen corresponding path program 1 times [2019-09-07 13:01:49,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:49,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:49,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:49,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:49,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:49,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:49,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:01:49,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:01:49,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:01:49,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:49,409 INFO L87 Difference]: Start difference. First operand 950 states and 1200 transitions. Second operand 6 states. [2019-09-07 13:01:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:49,530 INFO L93 Difference]: Finished difference Result 971 states and 1221 transitions. [2019-09-07 13:01:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:01:49,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-09-07 13:01:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:49,534 INFO L225 Difference]: With dead ends: 971 [2019-09-07 13:01:49,534 INFO L226 Difference]: Without dead ends: 940 [2019-09-07 13:01:49,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-09-07 13:01:49,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-09-07 13:01:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-07 13:01:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1188 transitions. [2019-09-07 13:01:49,627 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1188 transitions. Word has length 60 [2019-09-07 13:01:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:49,627 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1188 transitions. [2019-09-07 13:01:49,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:01:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1188 transitions. [2019-09-07 13:01:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 13:01:49,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:49,630 INFO L399 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] [2019-09-07 13:01:49,630 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:49,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:49,630 INFO L82 PathProgramCache]: Analyzing trace with hash 365447091, now seen corresponding path program 1 times [2019-09-07 13:01:49,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:49,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:49,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:49,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:49,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:49,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:49,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:49,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:49,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:49,718 INFO L87 Difference]: Start difference. First operand 940 states and 1188 transitions. Second operand 5 states. [2019-09-07 13:01:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:50,050 INFO L93 Difference]: Finished difference Result 1438 states and 1828 transitions. [2019-09-07 13:01:50,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:50,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-07 13:01:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:50,056 INFO L225 Difference]: With dead ends: 1438 [2019-09-07 13:01:50,056 INFO L226 Difference]: Without dead ends: 940 [2019-09-07 13:01:50,059 INFO L628 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 [2019-09-07 13:01:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-09-07 13:01:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-09-07 13:01:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-07 13:01:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1184 transitions. [2019-09-07 13:01:50,119 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1184 transitions. Word has length 68 [2019-09-07 13:01:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:50,120 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1184 transitions. [2019-09-07 13:01:50,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1184 transitions. [2019-09-07 13:01:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 13:01:50,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:50,123 INFO L399 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] [2019-09-07 13:01:50,123 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:50,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1376834024, now seen corresponding path program 1 times [2019-09-07 13:01:50,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:50,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:50,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:50,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:50,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:50,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:50,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:50,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:50,198 INFO L87 Difference]: Start difference. First operand 940 states and 1184 transitions. Second operand 5 states. [2019-09-07 13:01:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:50,292 INFO L93 Difference]: Finished difference Result 1088 states and 1356 transitions. [2019-09-07 13:01:50,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:50,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-07 13:01:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:50,303 INFO L225 Difference]: With dead ends: 1088 [2019-09-07 13:01:50,304 INFO L226 Difference]: Without dead ends: 952 [2019-09-07 13:01:50,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-09-07 13:01:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 948. [2019-09-07 13:01:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-09-07 13:01:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1192 transitions. [2019-09-07 13:01:50,400 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1192 transitions. Word has length 63 [2019-09-07 13:01:50,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:50,402 INFO L475 AbstractCegarLoop]: Abstraction has 948 states and 1192 transitions. [2019-09-07 13:01:50,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1192 transitions. [2019-09-07 13:01:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 13:01:50,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:50,405 INFO L399 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] [2019-09-07 13:01:50,405 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:50,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:50,406 INFO L82 PathProgramCache]: Analyzing trace with hash 902963543, now seen corresponding path program 1 times [2019-09-07 13:01:50,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:50,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:50,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:50,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:50,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:50,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:01:50,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:01:50,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:01:50,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:01:50,552 INFO L87 Difference]: Start difference. First operand 948 states and 1192 transitions. Second operand 9 states. [2019-09-07 13:01:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:50,690 INFO L93 Difference]: Finished difference Result 1121 states and 1390 transitions. [2019-09-07 13:01:50,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:01:50,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-09-07 13:01:50,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:50,694 INFO L225 Difference]: With dead ends: 1121 [2019-09-07 13:01:50,694 INFO L226 Difference]: Without dead ends: 952 [2019-09-07 13:01:50,696 INFO L628 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 [2019-09-07 13:01:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-09-07 13:01:50,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 950. [2019-09-07 13:01:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-09-07 13:01:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1192 transitions. [2019-09-07 13:01:50,756 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1192 transitions. Word has length 63 [2019-09-07 13:01:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:50,756 INFO L475 AbstractCegarLoop]: Abstraction has 950 states and 1192 transitions. [2019-09-07 13:01:50,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:01:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1192 transitions. [2019-09-07 13:01:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 13:01:50,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:50,760 INFO L399 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] [2019-09-07 13:01:50,760 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:50,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2130993218, now seen corresponding path program 1 times [2019-09-07 13:01:50,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:50,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:50,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:50,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:50,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:50,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:50,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:01:50,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:01:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:01:50,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:01:50,846 INFO L87 Difference]: Start difference. First operand 950 states and 1192 transitions. Second operand 9 states. [2019-09-07 13:01:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:51,058 INFO L93 Difference]: Finished difference Result 983 states and 1226 transitions. [2019-09-07 13:01:51,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:01:51,059 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-09-07 13:01:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:51,062 INFO L225 Difference]: With dead ends: 983 [2019-09-07 13:01:51,063 INFO L226 Difference]: Without dead ends: 940 [2019-09-07 13:01:51,064 INFO L628 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 [2019-09-07 13:01:51,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-09-07 13:01:51,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-09-07 13:01:51,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-07 13:01:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1176 transitions. [2019-09-07 13:01:51,151 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1176 transitions. Word has length 62 [2019-09-07 13:01:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:51,152 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1176 transitions. [2019-09-07 13:01:51,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:01:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1176 transitions. [2019-09-07 13:01:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 13:01:51,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:51,154 INFO L399 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] [2019-09-07 13:01:51,155 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:51,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:51,155 INFO L82 PathProgramCache]: Analyzing trace with hash -758800695, now seen corresponding path program 1 times [2019-09-07 13:01:51,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:51,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:51,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:51,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:51,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:51,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:51,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 13:01:51,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 13:01:51,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 13:01:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 13:01:51,194 INFO L87 Difference]: Start difference. First operand 940 states and 1176 transitions. Second operand 3 states. [2019-09-07 13:01:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:51,252 INFO L93 Difference]: Finished difference Result 1468 states and 1866 transitions. [2019-09-07 13:01:51,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 13:01:51,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-07 13:01:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:51,257 INFO L225 Difference]: With dead ends: 1468 [2019-09-07 13:01:51,257 INFO L226 Difference]: Without dead ends: 970 [2019-09-07 13:01:51,259 INFO L628 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 [2019-09-07 13:01:51,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-07 13:01:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 940. [2019-09-07 13:01:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-07 13:01:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1176 transitions. [2019-09-07 13:01:51,318 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1176 transitions. Word has length 71 [2019-09-07 13:01:51,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:51,319 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1176 transitions. [2019-09-07 13:01:51,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 13:01:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1176 transitions. [2019-09-07 13:01:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 13:01:51,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:51,321 INFO L399 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] [2019-09-07 13:01:51,322 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:51,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1235234569, now seen corresponding path program 1 times [2019-09-07 13:01:51,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:51,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:51,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:51,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:51,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:51,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:01:51,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:01:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:01:51,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:51,411 INFO L87 Difference]: Start difference. First operand 940 states and 1176 transitions. Second operand 6 states. [2019-09-07 13:01:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:51,500 INFO L93 Difference]: Finished difference Result 1402 states and 1775 transitions. [2019-09-07 13:01:51,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:01:51,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-07 13:01:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:51,505 INFO L225 Difference]: With dead ends: 1402 [2019-09-07 13:01:51,505 INFO L226 Difference]: Without dead ends: 969 [2019-09-07 13:01:51,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-09-07 13:01:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 940. [2019-09-07 13:01:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-09-07 13:01:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1172 transitions. [2019-09-07 13:01:51,566 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1172 transitions. Word has length 71 [2019-09-07 13:01:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:51,567 INFO L475 AbstractCegarLoop]: Abstraction has 940 states and 1172 transitions. [2019-09-07 13:01:51,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:01:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1172 transitions. [2019-09-07 13:01:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 13:01:51,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:51,570 INFO L399 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] [2019-09-07 13:01:51,570 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash -640230042, now seen corresponding path program 1 times [2019-09-07 13:01:51,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:51,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:51,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:51,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:51,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:01:51,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:01:51,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:01:51,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:01:51,648 INFO L87 Difference]: Start difference. First operand 940 states and 1172 transitions. Second operand 9 states. [2019-09-07 13:01:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:51,870 INFO L93 Difference]: Finished difference Result 973 states and 1206 transitions. [2019-09-07 13:01:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:01:51,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-09-07 13:01:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:51,874 INFO L225 Difference]: With dead ends: 973 [2019-09-07 13:01:51,874 INFO L226 Difference]: Without dead ends: 928 [2019-09-07 13:01:51,874 INFO L628 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 [2019-09-07 13:01:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-07 13:01:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2019-09-07 13:01:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-09-07 13:01:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1154 transitions. [2019-09-07 13:01:51,928 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1154 transitions. Word has length 63 [2019-09-07 13:01:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:51,928 INFO L475 AbstractCegarLoop]: Abstraction has 928 states and 1154 transitions. [2019-09-07 13:01:51,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:01:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1154 transitions. [2019-09-07 13:01:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 13:01:51,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:51,931 INFO L399 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] [2019-09-07 13:01:51,931 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:51,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:51,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1615803884, now seen corresponding path program 1 times [2019-09-07 13:01:51,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:51,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:51,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:51,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:52,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:52,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:01:52,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:01:52,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:01:52,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:01:52,009 INFO L87 Difference]: Start difference. First operand 928 states and 1154 transitions. Second operand 9 states. [2019-09-07 13:01:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:52,199 INFO L93 Difference]: Finished difference Result 961 states and 1188 transitions. [2019-09-07 13:01:52,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:01:52,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-09-07 13:01:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:52,203 INFO L225 Difference]: With dead ends: 961 [2019-09-07 13:01:52,203 INFO L226 Difference]: Without dead ends: 918 [2019-09-07 13:01:52,205 INFO L628 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 [2019-09-07 13:01:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-07 13:01:52,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2019-09-07 13:01:52,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-09-07 13:01:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1138 transitions. [2019-09-07 13:01:52,260 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1138 transitions. Word has length 63 [2019-09-07 13:01:52,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:52,261 INFO L475 AbstractCegarLoop]: Abstraction has 918 states and 1138 transitions. [2019-09-07 13:01:52,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:01:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1138 transitions. [2019-09-07 13:01:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 13:01:52,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:52,263 INFO L399 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] [2019-09-07 13:01:52,264 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1125618577, now seen corresponding path program 1 times [2019-09-07 13:01:52,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:52,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:52,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:52,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:52,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:52,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-07 13:01:52,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 13:01:52,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 13:01:52,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:01:52,344 INFO L87 Difference]: Start difference. First operand 918 states and 1138 transitions. Second operand 8 states. [2019-09-07 13:01:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:52,516 INFO L93 Difference]: Finished difference Result 935 states and 1154 transitions. [2019-09-07 13:01:52,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 13:01:52,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-09-07 13:01:52,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:52,528 INFO L225 Difference]: With dead ends: 935 [2019-09-07 13:01:52,529 INFO L226 Difference]: Without dead ends: 903 [2019-09-07 13:01:52,531 INFO L628 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 [2019-09-07 13:01:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-09-07 13:01:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 903. [2019-09-07 13:01:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-09-07 13:01:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1118 transitions. [2019-09-07 13:01:52,603 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1118 transitions. Word has length 63 [2019-09-07 13:01:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:52,603 INFO L475 AbstractCegarLoop]: Abstraction has 903 states and 1118 transitions. [2019-09-07 13:01:52,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 13:01:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1118 transitions. [2019-09-07 13:01:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 13:01:52,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:52,606 INFO L399 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] [2019-09-07 13:01:52,607 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:52,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:52,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1413103402, now seen corresponding path program 1 times [2019-09-07 13:01:52,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:52,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:52,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:52,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:52,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:52,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 13:01:52,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 13:01:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 13:01:52,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:01:52,713 INFO L87 Difference]: Start difference. First operand 903 states and 1118 transitions. Second operand 4 states. [2019-09-07 13:01:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:52,938 INFO L93 Difference]: Finished difference Result 1198 states and 1440 transitions. [2019-09-07 13:01:52,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 13:01:52,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-09-07 13:01:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:52,943 INFO L225 Difference]: With dead ends: 1198 [2019-09-07 13:01:52,943 INFO L226 Difference]: Without dead ends: 658 [2019-09-07 13:01:52,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 13:01:52,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-09-07 13:01:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 623. [2019-09-07 13:01:52,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-07 13:01:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 748 transitions. [2019-09-07 13:01:53,000 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 748 transitions. Word has length 70 [2019-09-07 13:01:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:53,001 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 748 transitions. [2019-09-07 13:01:53,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 13:01:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 748 transitions. [2019-09-07 13:01:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 13:01:53,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:53,004 INFO L399 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] [2019-09-07 13:01:53,004 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:53,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:53,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1766191784, now seen corresponding path program 1 times [2019-09-07 13:01:53,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:53,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:53,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:53,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:53,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:53,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:53,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:53,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:53,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:53,150 INFO L87 Difference]: Start difference. First operand 623 states and 748 transitions. Second operand 5 states. [2019-09-07 13:01:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:53,583 INFO L93 Difference]: Finished difference Result 990 states and 1203 transitions. [2019-09-07 13:01:53,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:01:53,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-07 13:01:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:53,586 INFO L225 Difference]: With dead ends: 990 [2019-09-07 13:01:53,586 INFO L226 Difference]: Without dead ends: 737 [2019-09-07 13:01:53,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-07 13:01:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-07 13:01:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 697. [2019-09-07 13:01:53,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-07 13:01:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 842 transitions. [2019-09-07 13:01:53,642 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 842 transitions. Word has length 70 [2019-09-07 13:01:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:53,643 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 842 transitions. [2019-09-07 13:01:53,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 842 transitions. [2019-09-07 13:01:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 13:01:53,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:53,645 INFO L399 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] [2019-09-07 13:01:53,645 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:53,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:53,645 INFO L82 PathProgramCache]: Analyzing trace with hash 593942687, now seen corresponding path program 1 times [2019-09-07 13:01:53,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:53,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:53,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:53,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:53,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:53,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:53,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:01:53,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:01:53,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:01:53,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:01:53,720 INFO L87 Difference]: Start difference. First operand 697 states and 842 transitions. Second operand 9 states. [2019-09-07 13:01:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:53,915 INFO L93 Difference]: Finished difference Result 726 states and 870 transitions. [2019-09-07 13:01:53,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:01:53,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-09-07 13:01:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:53,918 INFO L225 Difference]: With dead ends: 726 [2019-09-07 13:01:53,918 INFO L226 Difference]: Without dead ends: 651 [2019-09-07 13:01:53,920 INFO L628 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 [2019-09-07 13:01:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-07 13:01:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-07 13:01:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-07 13:01:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 785 transitions. [2019-09-07 13:01:53,964 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 785 transitions. Word has length 67 [2019-09-07 13:01:53,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:53,964 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 785 transitions. [2019-09-07 13:01:53,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:01:53,964 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 785 transitions. [2019-09-07 13:01:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-07 13:01:53,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:53,966 INFO L399 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] [2019-09-07 13:01:53,966 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1097233248, now seen corresponding path program 1 times [2019-09-07 13:01:53,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:53,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:53,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:53,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:53,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:54,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:54,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:01:54,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:01:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:01:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:54,074 INFO L87 Difference]: Start difference. First operand 651 states and 785 transitions. Second operand 7 states. [2019-09-07 13:01:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:54,751 INFO L93 Difference]: Finished difference Result 985 states and 1196 transitions. [2019-09-07 13:01:54,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:01:54,751 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-09-07 13:01:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:54,753 INFO L225 Difference]: With dead ends: 985 [2019-09-07 13:01:54,754 INFO L226 Difference]: Without dead ends: 676 [2019-09-07 13:01:54,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:01:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-09-07 13:01:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 635. [2019-09-07 13:01:54,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-07 13:01:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 757 transitions. [2019-09-07 13:01:54,830 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 757 transitions. Word has length 82 [2019-09-07 13:01:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:54,830 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 757 transitions. [2019-09-07 13:01:54,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:01:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 757 transitions. [2019-09-07 13:01:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 13:01:54,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:54,832 INFO L399 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] [2019-09-07 13:01:54,832 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:54,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:54,833 INFO L82 PathProgramCache]: Analyzing trace with hash -501162190, now seen corresponding path program 1 times [2019-09-07 13:01:54,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:54,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:54,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:54,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:54,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:54,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:54,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:54,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:54,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:54,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:54,880 INFO L87 Difference]: Start difference. First operand 635 states and 757 transitions. Second operand 5 states. [2019-09-07 13:01:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:54,930 INFO L93 Difference]: Finished difference Result 737 states and 869 transitions. [2019-09-07 13:01:54,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:54,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-07 13:01:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:54,932 INFO L225 Difference]: With dead ends: 737 [2019-09-07 13:01:54,933 INFO L226 Difference]: Without dead ends: 633 [2019-09-07 13:01:54,933 INFO L628 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 [2019-09-07 13:01:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-07 13:01:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-09-07 13:01:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-07 13:01:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 753 transitions. [2019-09-07 13:01:54,983 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 753 transitions. Word has length 76 [2019-09-07 13:01:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:54,984 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 753 transitions. [2019-09-07 13:01:54,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 753 transitions. [2019-09-07 13:01:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 13:01:54,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:54,987 INFO L399 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] [2019-09-07 13:01:54,987 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:54,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:54,987 INFO L82 PathProgramCache]: Analyzing trace with hash 211753811, now seen corresponding path program 1 times [2019-09-07 13:01:54,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:54,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:54,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:54,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:54,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:55,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:55,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:01:55,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:01:55,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:01:55,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:01:55,087 INFO L87 Difference]: Start difference. First operand 633 states and 753 transitions. Second operand 9 states. [2019-09-07 13:01:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:55,201 INFO L93 Difference]: Finished difference Result 643 states and 762 transitions. [2019-09-07 13:01:55,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:01:55,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-09-07 13:01:55,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:55,204 INFO L225 Difference]: With dead ends: 643 [2019-09-07 13:01:55,204 INFO L226 Difference]: Without dead ends: 559 [2019-09-07 13:01:55,205 INFO L628 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 [2019-09-07 13:01:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-07 13:01:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-07 13:01:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-07 13:01:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 665 transitions. [2019-09-07 13:01:55,260 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 665 transitions. Word has length 76 [2019-09-07 13:01:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:55,261 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 665 transitions. [2019-09-07 13:01:55,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:01:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 665 transitions. [2019-09-07 13:01:55,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 13:01:55,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:55,264 INFO L399 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] [2019-09-07 13:01:55,265 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:55,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:55,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1448627846, now seen corresponding path program 1 times [2019-09-07 13:01:55,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:55,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:55,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:55,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:55,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:55,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:01:55,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:01:55,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:01:55,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:55,377 INFO L87 Difference]: Start difference. First operand 559 states and 665 transitions. Second operand 6 states. [2019-09-07 13:01:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:55,453 INFO L93 Difference]: Finished difference Result 883 states and 1082 transitions. [2019-09-07 13:01:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:01:55,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-07 13:01:55,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:55,456 INFO L225 Difference]: With dead ends: 883 [2019-09-07 13:01:55,457 INFO L226 Difference]: Without dead ends: 629 [2019-09-07 13:01:55,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:55,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-07 13:01:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 525. [2019-09-07 13:01:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-09-07 13:01:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 621 transitions. [2019-09-07 13:01:55,495 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 621 transitions. Word has length 83 [2019-09-07 13:01:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:55,495 INFO L475 AbstractCegarLoop]: Abstraction has 525 states and 621 transitions. [2019-09-07 13:01:55,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:01:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 621 transitions. [2019-09-07 13:01:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 13:01:55,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:55,499 INFO L399 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] [2019-09-07 13:01:55,499 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1423797197, now seen corresponding path program 1 times [2019-09-07 13:01:55,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:55,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:55,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:55,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:55,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:55,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:55,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:55,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:55,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:55,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:55,549 INFO L87 Difference]: Start difference. First operand 525 states and 621 transitions. Second operand 5 states. [2019-09-07 13:01:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:55,976 INFO L93 Difference]: Finished difference Result 1052 states and 1231 transitions. [2019-09-07 13:01:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:01:55,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-07 13:01:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:55,979 INFO L225 Difference]: With dead ends: 1052 [2019-09-07 13:01:55,979 INFO L226 Difference]: Without dead ends: 665 [2019-09-07 13:01:55,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-09-07 13:01:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 642. [2019-09-07 13:01:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-07 13:01:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 749 transitions. [2019-09-07 13:01:56,025 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 749 transitions. Word has length 79 [2019-09-07 13:01:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:56,025 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 749 transitions. [2019-09-07 13:01:56,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 749 transitions. [2019-09-07 13:01:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 13:01:56,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:56,027 INFO L399 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] [2019-09-07 13:01:56,027 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:56,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:56,028 INFO L82 PathProgramCache]: Analyzing trace with hash 567047082, now seen corresponding path program 1 times [2019-09-07 13:01:56,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:56,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:56,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:56,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:56,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:56,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:56,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:01:56,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:01:56,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:01:56,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:01:56,099 INFO L87 Difference]: Start difference. First operand 642 states and 749 transitions. Second operand 9 states. [2019-09-07 13:01:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:56,275 INFO L93 Difference]: Finished difference Result 644 states and 750 transitions. [2019-09-07 13:01:56,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:01:56,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-07 13:01:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:56,278 INFO L225 Difference]: With dead ends: 644 [2019-09-07 13:01:56,278 INFO L226 Difference]: Without dead ends: 449 [2019-09-07 13:01:56,279 INFO L628 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 [2019-09-07 13:01:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-07 13:01:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-09-07 13:01:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-07 13:01:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 533 transitions. [2019-09-07 13:01:56,311 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 533 transitions. Word has length 80 [2019-09-07 13:01:56,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:56,311 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 533 transitions. [2019-09-07 13:01:56,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:01:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 533 transitions. [2019-09-07 13:01:56,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 13:01:56,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:56,313 INFO L399 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] [2019-09-07 13:01:56,313 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:56,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:56,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1336030567, now seen corresponding path program 1 times [2019-09-07 13:01:56,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:56,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:56,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:56,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:56,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:56,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:56,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:01:56,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:01:56,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:01:56,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:01:56,384 INFO L87 Difference]: Start difference. First operand 449 states and 533 transitions. Second operand 9 states. [2019-09-07 13:01:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:56,513 INFO L93 Difference]: Finished difference Result 470 states and 554 transitions. [2019-09-07 13:01:56,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:01:56,513 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-07 13:01:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:56,515 INFO L225 Difference]: With dead ends: 470 [2019-09-07 13:01:56,515 INFO L226 Difference]: Without dead ends: 449 [2019-09-07 13:01:56,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-07 13:01:56,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-07 13:01:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-09-07 13:01:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-07 13:01:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 532 transitions. [2019-09-07 13:01:56,566 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 532 transitions. Word has length 88 [2019-09-07 13:01:56,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:56,567 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 532 transitions. [2019-09-07 13:01:56,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:01:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 532 transitions. [2019-09-07 13:01:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 13:01:56,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:56,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:56,571 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:56,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:56,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2100668997, now seen corresponding path program 1 times [2019-09-07 13:01:56,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:56,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:56,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:56,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:56,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:56,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:56,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-07 13:01:56,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 13:01:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 13:01:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:56,693 INFO L87 Difference]: Start difference. First operand 449 states and 532 transitions. Second operand 7 states. [2019-09-07 13:01:56,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:56,847 INFO L93 Difference]: Finished difference Result 847 states and 1007 transitions. [2019-09-07 13:01:56,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:01:56,848 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-09-07 13:01:56,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:56,850 INFO L225 Difference]: With dead ends: 847 [2019-09-07 13:01:56,851 INFO L226 Difference]: Without dead ends: 792 [2019-09-07 13:01:56,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:01:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-09-07 13:01:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 370. [2019-09-07 13:01:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-07 13:01:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 431 transitions. [2019-09-07 13:01:56,886 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 431 transitions. Word has length 99 [2019-09-07 13:01:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:56,886 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 431 transitions. [2019-09-07 13:01:56,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 13:01:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 431 transitions. [2019-09-07 13:01:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-07 13:01:56,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:56,888 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:56,889 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:56,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:56,889 INFO L82 PathProgramCache]: Analyzing trace with hash -289766285, now seen corresponding path program 1 times [2019-09-07 13:01:56,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:56,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:56,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:56,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:56,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 13:01:57,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:57,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-07 13:01:57,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 13:01:57,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 13:01:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-07 13:01:57,007 INFO L87 Difference]: Start difference. First operand 370 states and 431 transitions. Second operand 11 states. [2019-09-07 13:01:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:57,133 INFO L93 Difference]: Finished difference Result 515 states and 603 transitions. [2019-09-07 13:01:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 13:01:57,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-09-07 13:01:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:57,135 INFO L225 Difference]: With dead ends: 515 [2019-09-07 13:01:57,135 INFO L226 Difference]: Without dead ends: 366 [2019-09-07 13:01:57,136 INFO L628 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 [2019-09-07 13:01:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-07 13:01:57,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2019-09-07 13:01:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-09-07 13:01:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 408 transitions. [2019-09-07 13:01:57,165 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 408 transitions. Word has length 104 [2019-09-07 13:01:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:57,165 INFO L475 AbstractCegarLoop]: Abstraction has 353 states and 408 transitions. [2019-09-07 13:01:57,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 13:01:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 408 transitions. [2019-09-07 13:01:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 13:01:57,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:57,167 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:57,168 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:57,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:57,168 INFO L82 PathProgramCache]: Analyzing trace with hash -211623252, now seen corresponding path program 1 times [2019-09-07 13:01:57,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:57,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:57,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:57,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:57,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 13:01:57,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:57,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:01:57,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:01:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:01:57,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:57,228 INFO L87 Difference]: Start difference. First operand 353 states and 408 transitions. Second operand 6 states. [2019-09-07 13:01:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:57,275 INFO L93 Difference]: Finished difference Result 381 states and 434 transitions. [2019-09-07 13:01:57,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:01:57,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-09-07 13:01:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:57,277 INFO L225 Difference]: With dead ends: 381 [2019-09-07 13:01:57,277 INFO L226 Difference]: Without dead ends: 305 [2019-09-07 13:01:57,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-07 13:01:57,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2019-09-07 13:01:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-09-07 13:01:57,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 268 transitions. [2019-09-07 13:01:57,297 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 268 transitions. Word has length 113 [2019-09-07 13:01:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:57,298 INFO L475 AbstractCegarLoop]: Abstraction has 243 states and 268 transitions. [2019-09-07 13:01:57,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:01:57,298 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 268 transitions. [2019-09-07 13:01:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-07 13:01:57,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:57,300 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:57,300 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:57,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:57,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1015672895, now seen corresponding path program 1 times [2019-09-07 13:01:57,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:57,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:57,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:57,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:57,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-07 13:01:57,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:57,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-07 13:01:57,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 13:01:57,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 13:01:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-07 13:01:57,388 INFO L87 Difference]: Start difference. First operand 243 states and 268 transitions. Second operand 9 states. [2019-09-07 13:01:57,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:57,493 INFO L93 Difference]: Finished difference Result 316 states and 355 transitions. [2019-09-07 13:01:57,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 13:01:57,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-07 13:01:57,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:57,494 INFO L225 Difference]: With dead ends: 316 [2019-09-07 13:01:57,495 INFO L226 Difference]: Without dead ends: 287 [2019-09-07 13:01:57,495 INFO L628 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 [2019-09-07 13:01:57,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-07 13:01:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-09-07 13:01:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-07 13:01:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 293 transitions. [2019-09-07 13:01:57,516 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 293 transitions. Word has length 134 [2019-09-07 13:01:57,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:57,516 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 293 transitions. [2019-09-07 13:01:57,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 13:01:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 293 transitions. [2019-09-07 13:01:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-07 13:01:57,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:57,519 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:57,519 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:57,519 INFO L82 PathProgramCache]: Analyzing trace with hash 14849890, now seen corresponding path program 1 times [2019-09-07 13:01:57,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:57,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:57,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:57,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:57,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 13:01:57,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:57,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-07 13:01:57,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 13:01:57,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 13:01:57,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-07 13:01:57,691 INFO L87 Difference]: Start difference. First operand 263 states and 293 transitions. Second operand 15 states. [2019-09-07 13:01:57,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:57,880 INFO L93 Difference]: Finished difference Result 368 states and 412 transitions. [2019-09-07 13:01:57,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:01:57,881 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2019-09-07 13:01:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:57,883 INFO L225 Difference]: With dead ends: 368 [2019-09-07 13:01:57,883 INFO L226 Difference]: Without dead ends: 271 [2019-09-07 13:01:57,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-07 13:01:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-07 13:01:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2019-09-07 13:01:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-07 13:01:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-09-07 13:01:57,906 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 135 [2019-09-07 13:01:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:57,906 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-09-07 13:01:57,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 13:01:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-09-07 13:01:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-07 13:01:57,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:57,908 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:57,909 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:57,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:57,909 INFO L82 PathProgramCache]: Analyzing trace with hash 709369442, now seen corresponding path program 1 times [2019-09-07 13:01:57,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:57,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:57,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:57,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:57,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:01:57,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:57,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:57,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:57,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:57,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:57,970 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 5 states. [2019-09-07 13:01:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:58,018 INFO L93 Difference]: Finished difference Result 305 states and 339 transitions. [2019-09-07 13:01:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:58,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-09-07 13:01:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:58,019 INFO L225 Difference]: With dead ends: 305 [2019-09-07 13:01:58,019 INFO L226 Difference]: Without dead ends: 276 [2019-09-07 13:01:58,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-09-07 13:01:58,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 263. [2019-09-07 13:01:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-07 13:01:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-09-07 13:01:58,041 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 143 [2019-09-07 13:01:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:58,042 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-09-07 13:01:58,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-09-07 13:01:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 13:01:58,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:58,044 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:58,044 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:58,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:58,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1897304323, now seen corresponding path program 1 times [2019-09-07 13:01:58,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:58,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:58,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:58,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:58,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 13:01:58,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:58,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:01:58,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:01:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:01:58,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:58,118 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 6 states. [2019-09-07 13:01:58,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:58,177 INFO L93 Difference]: Finished difference Result 357 states and 400 transitions. [2019-09-07 13:01:58,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 13:01:58,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-07 13:01:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:58,178 INFO L225 Difference]: With dead ends: 357 [2019-09-07 13:01:58,178 INFO L226 Difference]: Without dead ends: 269 [2019-09-07 13:01:58,179 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-07 13:01:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2019-09-07 13:01:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-07 13:01:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2019-09-07 13:01:58,210 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 144 [2019-09-07 13:01:58,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:58,210 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2019-09-07 13:01:58,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:01:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2019-09-07 13:01:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-07 13:01:58,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:58,212 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:58,213 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:58,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:58,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1361167968, now seen corresponding path program 1 times [2019-09-07 13:01:58,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:58,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:58,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:58,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 13:01:58,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:58,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-07 13:01:58,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:01:58,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:01:58,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:01:58,425 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand 14 states. [2019-09-07 13:01:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:59,570 INFO L93 Difference]: Finished difference Result 317 states and 356 transitions. [2019-09-07 13:01:59,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:01:59,571 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2019-09-07 13:01:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:59,572 INFO L225 Difference]: With dead ends: 317 [2019-09-07 13:01:59,572 INFO L226 Difference]: Without dead ends: 292 [2019-09-07 13:01:59,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-09-07 13:01:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-07 13:01:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 254. [2019-09-07 13:01:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-07 13:01:59,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 278 transitions. [2019-09-07 13:01:59,592 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 278 transitions. Word has length 145 [2019-09-07 13:01:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:59,593 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 278 transitions. [2019-09-07 13:01:59,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:01:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 278 transitions. [2019-09-07 13:01:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 13:01:59,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:59,596 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:59,596 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash -659068543, now seen corresponding path program 1 times [2019-09-07 13:01:59,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:59,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:59,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:59,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:01:59,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:59,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 13:01:59,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 13:01:59,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 13:01:59,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 13:01:59,667 INFO L87 Difference]: Start difference. First operand 254 states and 278 transitions. Second operand 6 states. [2019-09-07 13:01:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:59,740 INFO L93 Difference]: Finished difference Result 341 states and 383 transitions. [2019-09-07 13:01:59,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:01:59,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-09-07 13:01:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:59,741 INFO L225 Difference]: With dead ends: 341 [2019-09-07 13:01:59,741 INFO L226 Difference]: Without dead ends: 281 [2019-09-07 13:01:59,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 13:01:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-07 13:01:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 258. [2019-09-07 13:01:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-07 13:01:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 282 transitions. [2019-09-07 13:01:59,763 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 282 transitions. Word has length 148 [2019-09-07 13:01:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:59,763 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 282 transitions. [2019-09-07 13:01:59,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 13:01:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 282 transitions. [2019-09-07 13:01:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-07 13:01:59,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:59,765 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:59,765 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2021606810, now seen corresponding path program 1 times [2019-09-07 13:01:59,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:59,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:59,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:59,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:01:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:01:59,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:01:59,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 13:01:59,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 13:01:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 13:01:59,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 13:01:59,845 INFO L87 Difference]: Start difference. First operand 258 states and 282 transitions. Second operand 5 states. [2019-09-07 13:01:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:01:59,883 INFO L93 Difference]: Finished difference Result 294 states and 319 transitions. [2019-09-07 13:01:59,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 13:01:59,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-07 13:01:59,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:01:59,885 INFO L225 Difference]: With dead ends: 294 [2019-09-07 13:01:59,885 INFO L226 Difference]: Without dead ends: 264 [2019-09-07 13:01:59,885 INFO L628 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 [2019-09-07 13:01:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-07 13:01:59,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-07 13:01:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-07 13:01:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 286 transitions. [2019-09-07 13:01:59,907 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 286 transitions. Word has length 150 [2019-09-07 13:01:59,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:01:59,907 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 286 transitions. [2019-09-07 13:01:59,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 13:01:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 286 transitions. [2019-09-07 13:01:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-07 13:01:59,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:01:59,909 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:01:59,909 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:01:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:01:59,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2091873989, now seen corresponding path program 1 times [2019-09-07 13:01:59,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:01:59,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:01:59,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:59,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:01:59,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:01:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:00,063 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 13:02:00,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:00,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-07 13:02:00,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 13:02:00,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 13:02:00,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-07 13:02:00,065 INFO L87 Difference]: Start difference. First operand 262 states and 286 transitions. Second operand 15 states. [2019-09-07 13:02:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:00,286 INFO L93 Difference]: Finished difference Result 319 states and 355 transitions. [2019-09-07 13:02:00,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 13:02:00,286 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 150 [2019-09-07 13:02:00,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:00,288 INFO L225 Difference]: With dead ends: 319 [2019-09-07 13:02:00,288 INFO L226 Difference]: Without dead ends: 283 [2019-09-07 13:02:00,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-07 13:02:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-09-07 13:02:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 270. [2019-09-07 13:02:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-07 13:02:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2019-09-07 13:02:00,312 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 150 [2019-09-07 13:02:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:00,312 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2019-09-07 13:02:00,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 13:02:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2019-09-07 13:02:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-07 13:02:00,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:00,314 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:00,314 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1666371012, now seen corresponding path program 1 times [2019-09-07 13:02:00,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:00,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:00,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 13:02:00,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:00,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-07 13:02:00,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:00,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 13:02:00,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:02:00,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:00,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-09-07 13:02:00,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 13:02:00,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 13:02:00,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-07 13:02:00,990 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand 21 states. [2019-09-07 13:02:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:01,233 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2019-09-07 13:02:01,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 13:02:01,233 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 153 [2019-09-07 13:02:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:01,235 INFO L225 Difference]: With dead ends: 316 [2019-09-07 13:02:01,235 INFO L226 Difference]: Without dead ends: 275 [2019-09-07 13:02:01,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2019-09-07 13:02:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-07 13:02:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 264. [2019-09-07 13:02:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-07 13:02:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 286 transitions. [2019-09-07 13:02:01,291 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 286 transitions. Word has length 153 [2019-09-07 13:02:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:01,292 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 286 transitions. [2019-09-07 13:02:01,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 13:02:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 286 transitions. [2019-09-07 13:02:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 13:02:01,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:01,295 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:01,295 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:01,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:01,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1416389275, now seen corresponding path program 1 times [2019-09-07 13:02:01,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:01,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-07 13:02:01,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:01,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-07 13:02:01,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:01,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 13:02:01,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 13:02:01,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:01,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2019-09-07 13:02:01,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 13:02:01,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 13:02:01,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-09-07 13:02:01,921 INFO L87 Difference]: Start difference. First operand 264 states and 286 transitions. Second operand 14 states. [2019-09-07 13:02:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:02,169 INFO L93 Difference]: Finished difference Result 325 states and 350 transitions. [2019-09-07 13:02:02,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 13:02:02,169 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 158 [2019-09-07 13:02:02,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:02,171 INFO L225 Difference]: With dead ends: 325 [2019-09-07 13:02:02,171 INFO L226 Difference]: Without dead ends: 237 [2019-09-07 13:02:02,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-09-07 13:02:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-07 13:02:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-09-07 13:02:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-07 13:02:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 247 transitions. [2019-09-07 13:02:02,198 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 247 transitions. Word has length 158 [2019-09-07 13:02:02,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:02,198 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 247 transitions. [2019-09-07 13:02:02,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 13:02:02,199 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 247 transitions. [2019-09-07 13:02:02,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-07 13:02:02,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:02,200 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:02,200 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:02,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:02,200 INFO L82 PathProgramCache]: Analyzing trace with hash -278790820, now seen corresponding path program 1 times [2019-09-07 13:02:02,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:02,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:02,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:02,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:02,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 13:02:02,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 13:02:02,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-07 13:02:02,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 13:02:02,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 13:02:02,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-07 13:02:02,338 INFO L87 Difference]: Start difference. First operand 231 states and 247 transitions. Second operand 10 states. [2019-09-07 13:02:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:02,995 INFO L93 Difference]: Finished difference Result 456 states and 489 transitions. [2019-09-07 13:02:02,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 13:02:02,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2019-09-07 13:02:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:02,997 INFO L225 Difference]: With dead ends: 456 [2019-09-07 13:02:02,997 INFO L226 Difference]: Without dead ends: 234 [2019-09-07 13:02:02,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2019-09-07 13:02:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-07 13:02:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-09-07 13:02:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-07 13:02:03,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 246 transitions. [2019-09-07 13:02:03,024 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 246 transitions. Word has length 161 [2019-09-07 13:02:03,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:03,025 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 246 transitions. [2019-09-07 13:02:03,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 13:02:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 246 transitions. [2019-09-07 13:02:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-07 13:02:03,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 13:02:03,026 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 13:02:03,026 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 13:02:03,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 13:02:03,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1201958246, now seen corresponding path program 1 times [2019-09-07 13:02:03,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 13:02:03,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 13:02:03,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:03,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:03,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 13:02:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 13:02:03,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 13:02:03,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-07 13:02:03,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 13:02:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 13:02:03,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 13:02:03,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 13:02:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-07 13:02:03,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 13:02:03,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2019-09-07 13:02:03,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 13:02:03,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 13:02:03,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-09-07 13:02:03,625 INFO L87 Difference]: Start difference. First operand 231 states and 246 transitions. Second operand 19 states. [2019-09-07 13:02:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 13:02:05,155 INFO L93 Difference]: Finished difference Result 302 states and 325 transitions. [2019-09-07 13:02:05,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 13:02:05,156 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 161 [2019-09-07 13:02:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 13:02:05,156 INFO L225 Difference]: With dead ends: 302 [2019-09-07 13:02:05,156 INFO L226 Difference]: Without dead ends: 0 [2019-09-07 13:02:05,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 13:02:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-07 13:02:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-07 13:02:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-07 13:02:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-07 13:02:05,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2019-09-07 13:02:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 13:02:05,159 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-07 13:02:05,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 13:02:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-07 13:02:05,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-07 13:02:05,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-07 13:02:05,308 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 99 [2019-09-07 13:02:08,591 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-09-07 13:02:09,272 WARN L188 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 72 [2019-09-07 13:02:09,531 WARN L188 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2019-09-07 13:02:09,775 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-09-07 13:02:10,088 WARN L188 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 82 [2019-09-07 13:02:10,411 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2019-09-07 13:02:10,670 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2019-09-07 13:02:11,130 WARN L188 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 78 [2019-09-07 13:02:11,286 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-07 13:02:11,642 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 79 [2019-09-07 13:02:12,245 WARN L188 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 65 [2019-09-07 13:02:12,393 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 1 [2019-09-07 13:02:13,011 WARN L188 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 93 [2019-09-07 13:02:13,164 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-09-07 13:02:13,286 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 1 [2019-09-07 13:02:14,817 WARN L188 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 168 DAG size of output: 107 [2019-09-07 13:02:15,017 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-09-07 13:02:15,328 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-09-07 13:02:15,790 WARN L188 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 78 [2019-09-07 13:02:15,894 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 1 [2019-09-07 13:02:16,581 WARN L188 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 112 [2019-09-07 13:02:16,971 WARN L188 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 76 [2019-09-07 13:02:17,126 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-07 13:02:17,369 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 61 [2019-09-07 13:02:17,490 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-07 13:02:17,705 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 1 [2019-09-07 13:02:18,011 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 78 [2019-09-07 13:02:18,165 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-07 13:02:19,122 WARN L188 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 103 [2019-09-07 13:02:19,805 WARN L188 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 98 [2019-09-07 13:02:20,088 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 76 [2019-09-07 13:02:20,241 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-07 13:02:20,592 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-09-07 13:02:21,040 WARN L188 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 77 [2019-09-07 13:02:21,250 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 74 [2019-09-07 13:02:22,845 WARN L188 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 204 DAG size of output: 107 [2019-09-07 13:02:23,213 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 71 [2019-09-07 13:02:23,614 WARN L188 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 82 [2019-09-07 13:02:23,769 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-09-07 13:02:23,931 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-09-07 13:02:24,274 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2019-09-07 13:02:24,507 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 77 [2019-09-07 13:02:25,145 WARN L188 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 93 [2019-09-07 13:02:25,265 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 1 [2019-09-07 13:02:25,614 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 75 [2019-09-07 13:02:25,839 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-09-07 13:02:25,987 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 1 [2019-09-07 13:02:26,729 WARN L188 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 96 [2019-09-07 13:02:27,006 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-09-07 13:02:27,370 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 88 [2019-09-07 13:02:27,524 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-07 13:02:28,414 WARN L188 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 94 [2019-09-07 13:02:28,551 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 1 [2019-09-07 13:02:29,170 WARN L188 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 94 [2019-09-07 13:02:30,634 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 190 DAG size of output: 110 [2019-09-07 13:02:30,934 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2019-09-07 13:02:31,333 WARN L188 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 77 [2019-09-07 13:02:31,561 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-09-07 13:02:31,822 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 68 [2019-09-07 13:02:32,091 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2019-09-07 13:02:32,212 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-07 13:02:33,268 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 167 DAG size of output: 98 [2019-09-07 13:02:33,407 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 1 [2019-09-07 13:02:33,833 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 78 [2019-09-07 13:02:34,159 WARN L188 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2019-09-07 13:02:34,563 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2019-09-07 13:02:34,733 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-07 13:02:34,984 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-09-07 13:02:35,717 WARN L188 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 92 [2019-09-07 13:02:36,196 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-09-07 13:02:36,620 WARN L188 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2019-09-07 13:02:36,731 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 1 [2019-09-07 13:02:36,883 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-07 13:02:37,083 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 80 [2019-09-07 13:02:37,708 WARN L188 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 94 [2019-09-07 13:02:39,208 WARN L188 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 190 DAG size of output: 110 [2019-09-07 13:02:39,614 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 91 [2019-09-07 13:02:40,098 WARN L188 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 81 [2019-09-07 13:02:40,323 WARN L188 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2019-09-07 13:02:40,496 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 82 [2019-09-07 13:02:40,813 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2019-09-07 13:02:41,055 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2019-09-07 13:02:41,313 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 64 [2019-09-07 13:02:41,648 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 67 [2019-09-07 13:02:41,852 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-09-07 13:02:42,440 WARN L188 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 78 [2019-09-07 13:02:42,878 WARN L188 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 73 [2019-09-07 13:02:43,708 WARN L188 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 82 [2019-09-07 13:02:44,075 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2019-09-07 13:02:44,228 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2019-09-07 13:02:44,384 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-07 13:02:44,586 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2019-09-07 13:02:44,910 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 71 [2019-09-07 13:02:45,068 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-09-07 13:02:45,300 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2019-09-07 13:02:45,425 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 1 [2019-09-07 13:02:45,547 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-07 13:02:45,800 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 68 [2019-09-07 13:02:45,971 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-07 13:02:45,975 INFO L443 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceFINAL(lines 908 929) no Hoare annotation was computed. [2019-09-07 13:02:45,975 INFO L443 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 908 929) no Hoare annotation was computed. [2019-09-07 13:02:45,975 INFO L446 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 908 929) the Hoare annotation is: true [2019-09-07 13:02:45,975 INFO L446 ceAbstractionStarter]: At program point L918(lines 917 927) the Hoare annotation is: true [2019-09-07 13:02:45,975 INFO L446 ceAbstractionStarter]: At program point L916(lines 915 927) the Hoare annotation is: true [2019-09-07 13:02:45,975 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 927) no Hoare annotation was computed. [2019-09-07 13:02:45,975 INFO L443 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 66 86) no Hoare annotation was computed. [2019-09-07 13:02:45,976 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 66 86) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (<= ~MPR3~0 ~s~0) (= ~s~0 ~SKIP2~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (<= ~s~0 ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 ~PagingReferenceCount~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= ~PagingReferenceCount~0 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-09-07 13:02:45,976 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 66 86) no Hoare annotation was computed. [2019-09-07 13:02:45,976 INFO L443 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 930 950) no Hoare annotation was computed. [2019-09-07 13:02:45,976 INFO L446 ceAbstractionStarter]: At program point L939(lines 938 948) the Hoare annotation is: true [2019-09-07 13:02:45,976 INFO L446 ceAbstractionStarter]: At program point L937(lines 936 948) the Hoare annotation is: true [2019-09-07 13:02:45,976 INFO L443 ceAbstractionStarter]: For program point L936(lines 936 948) no Hoare annotation was computed. [2019-09-07 13:02:45,977 INFO L446 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 930 950) the Hoare annotation is: true [2019-09-07 13:02:45,977 INFO L443 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateFINAL(lines 930 950) no Hoare annotation was computed. [2019-09-07 13:02:45,977 INFO L443 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 646 652) no Hoare annotation was computed. [2019-09-07 13:02:45,977 INFO L443 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsENTRY(lines 646 652) no Hoare annotation was computed. [2019-09-07 13:02:45,977 INFO L443 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsFINAL(lines 646 652) no Hoare annotation was computed. [2019-09-07 13:02:45,977 INFO L439 ceAbstractionStarter]: At program point L225(lines 224 419) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= 1 ~s~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2019-09-07 13:02:45,978 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2019-09-07 13:02:45,978 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 194) no Hoare annotation was computed. [2019-09-07 13:02:45,978 INFO L439 ceAbstractionStarter]: At program point L341(line 341) the Hoare annotation is: (let ((.cse14 (<= ~MPR3~0 6)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse19 (<= 6 ~MPR3~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse8 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= ~myStatus~0 0)) (.cse6 (= 0 ~pended~0)) (.cse7 (<= ~PagingReferenceCount~0 1)) (.cse15 (= |old(~customIrp~0)| ~customIrp~0)) (.cse16 (<= 1 ~setEventCalled~0)) (.cse5 (<= FloppyPnp_~__cil_tmp30~0 259)) (.cse10 (<= 1 ~compRegistered~0)) (.cse11 (<= 259 FloppyPnp_~__cil_tmp30~0)) (.cse17 (<= ~setEventCalled~0 1)) (.cse18 (< 0 ~PagingReferenceCount~0))) (let ((.cse0 (and .cse4 .cse6 .cse7 .cse15 .cse16 .cse5 (= ~s~0 ~NP~0) (not (= 259 FloppyPnp_~ntStatus~0)) .cse10 .cse11 .cse17 .cse18)) (.cse1 (or (not .cse14) (not .cse12) (not .cse13) (not (<= |old(~PagingReferenceCount~0)| 0)) (not .cse19) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not .cse9) (not .cse8) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (and .cse4 .cse5 (<= 1 ~NP~0) .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~customIrp~0) .cse11 .cse12 (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse13 (<= ~NP~0 1) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3)))) [2019-09-07 13:02:45,978 INFO L443 ceAbstractionStarter]: For program point L341-1(line 341) no Hoare annotation was computed. [2019-09-07 13:02:45,978 INFO L443 ceAbstractionStarter]: For program point L209(lines 209 424) no Hoare annotation was computed. [2019-09-07 13:02:45,979 INFO L443 ceAbstractionStarter]: For program point L300(lines 300 306) no Hoare annotation was computed. [2019-09-07 13:02:45,979 INFO L439 ceAbstractionStarter]: At program point L325(line 325) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:45,979 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 290) no Hoare annotation was computed. [2019-09-07 13:02:45,979 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 421) no Hoare annotation was computed. [2019-09-07 13:02:45,979 INFO L439 ceAbstractionStarter]: At program point L408(line 408) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:45,979 INFO L443 ceAbstractionStarter]: For program point L408-1(lines 404 410) no Hoare annotation was computed. [2019-09-07 13:02:45,979 INFO L439 ceAbstractionStarter]: At program point L243(line 243) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:45,979 INFO L443 ceAbstractionStarter]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2019-09-07 13:02:45,980 INFO L439 ceAbstractionStarter]: At program point L202(line 202) the Hoare annotation is: (let ((.cse3 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not .cse3) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse3))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse2 .cse1)))) [2019-09-07 13:02:45,980 INFO L443 ceAbstractionStarter]: For program point L235-1(lines 228 416) no Hoare annotation was computed. [2019-09-07 13:02:45,980 INFO L443 ceAbstractionStarter]: For program point L202-1(line 202) no Hoare annotation was computed. [2019-09-07 13:02:45,980 INFO L439 ceAbstractionStarter]: At program point L392(lines 392 393) the Hoare annotation is: (let ((.cse10 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse11 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~pended~0)) (.cse5 (= 0 ~compRegistered~0)) (.cse7 (<= ~PagingReferenceCount~0 1)) (.cse9 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse12 (< 0 ~PagingReferenceCount~0))) (let ((.cse0 (and .cse4 .cse5 .cse7 .cse9 (= ~s~0 ~SKIP2~0) .cse12)) (.cse1 (or (not (<= ~MPR3~0 6)) (not .cse10) (not .cse11) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not .cse8) (not .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (and (= ~s~0 ~IPC~0) (<= 1 ~NP~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ~NP~0 5) ~MPR3~0) .cse11 (<= ~NP~0 1) .cse12))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3)))) [2019-09-07 13:02:45,980 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2019-09-07 13:02:45,980 INFO L443 ceAbstractionStarter]: For program point L392-1(lines 392 393) no Hoare annotation was computed. [2019-09-07 13:02:45,980 INFO L439 ceAbstractionStarter]: At program point L227(lines 226 419) the Hoare annotation is: (let ((.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not .cse5) (not .cse6) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not .cse4) (not .cse3) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5 (<= (+ ~NP~0 5) ~MPR3~0) .cse6))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2019-09-07 13:02:45,981 INFO L439 ceAbstractionStarter]: At program point L417(lines 228 418) the Hoare annotation is: (let ((.cse18 (= 0 ~pended~0)) (.cse21 (= ~s~0 ~DC~0))) (let ((.cse14 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse13 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse17 (= ~s~0 ~IPC~0)) (.cse11 (= ~s~0 ~SKIP2~0)) (.cse19 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse20 (<= ~compRegistered~0 0)) (.cse16 (and .cse18 .cse21)) (.cse10 (= 1 ~pended~0)) (.cse12 (= 0 ~compRegistered~0))) (let ((.cse0 (and .cse10 (= ~s~0 ~NP~0) .cse12)) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and (not (= 259 FloppyPnp_~ntStatus~0)) (and (<= ~PagingReferenceCount~0 1) .cse16 (< 0 ~PagingReferenceCount~0)))) (.cse3 (and .cse10 .cse12 .cse21)) (.cse4 (and .cse11 .cse18 .cse19 .cse20)) (.cse5 (and .cse17 .cse18 .cse19 .cse20)) (.cse6 (and .cse17 .cse10 .cse12)) (.cse7 (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) .cse16)) (.cse8 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not .cse14) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not .cse15) (not .cse13) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse9 (and .cse10 .cse11 (<= (+ ~NP~0 5) ~MPR3~0) .cse12 .cse13 .cse14 .cse15))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))))) [2019-09-07 13:02:45,981 INFO L439 ceAbstractionStarter]: At program point L351(line 351) the Hoare annotation is: (let ((.cse12 (<= ~MPR3~0 6)) (.cse9 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse15 (<= 6 ~MPR3~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~pended~0)) (.cse5 (<= ~PagingReferenceCount~0 1)) (.cse8 (<= 1 ~compRegistered~0)) (.cse11 (= 1 ~s~0)) (.cse13 (= |old(~customIrp~0)| ~customIrp~0)) (.cse14 (< 0 ~PagingReferenceCount~0))) (let ((.cse0 (and .cse4 .cse5 (not (= 259 FloppyPnp_~ntStatus~0)) .cse8 .cse11 .cse13 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) .cse14)) (.cse1 (or (not .cse12) (not .cse9) (not .cse10) (not (<= |old(~PagingReferenceCount~0)| 0)) (not .cse15) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not .cse7) (not .cse6) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (and (= ~myStatus~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~customIrp~0) .cse9 (<= ~s~0 ~NP~0) (= 0 FloppyPnp_~ntStatus~0) .cse10 (<= ~NP~0 1) .cse11 .cse12 .cse13 .cse14 .cse15))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3)))) [2019-09-07 13:02:45,981 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 330) no Hoare annotation was computed. [2019-09-07 13:02:45,981 INFO L439 ceAbstractionStarter]: At program point L219(lines 215 422) the Hoare annotation is: (let ((.cse3 (<= ~MPR3~0 6)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= 6 ~MPR3~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse0 (or (not .cse3) (not .cse7) (not .cse8) (not (<= |old(~PagingReferenceCount~0)| 0)) (not .cse4) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not .cse6) (not .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and (= ~myStatus~0 0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~s~0 |old(~s~0)|) (= 0 ~customIrp~0) (= 1 ~s~0) .cse3 (= |old(~customIrp~0)| ~customIrp~0) .cse4 (= ~s~0 ~NP~0) .cse5 .cse6 .cse7 (= 0 FloppyPnp_~ntStatus~0) .cse8 (< 0 ~PagingReferenceCount~0)))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2019-09-07 13:02:45,981 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-09-07 13:02:45,982 INFO L439 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2019-09-07 13:02:45,982 INFO L443 ceAbstractionStarter]: For program point L310-1(line 310) no Hoare annotation was computed. [2019-09-07 13:02:45,982 INFO L439 ceAbstractionStarter]: At program point L335(line 335) the Hoare annotation is: (let ((.cse0 (and (= ~myStatus~0 0) (= 0 ~pended~0) (<= ~PagingReferenceCount~0 1) (<= 1 ~compRegistered~0) (= 0 FloppyPnp_~ntStatus~0) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2))) [2019-09-07 13:02:45,982 INFO L443 ceAbstractionStarter]: For program point L335-1(line 335) no Hoare annotation was computed. [2019-09-07 13:02:45,982 INFO L439 ceAbstractionStarter]: At program point L261(lines 261 262) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0)) (.cse7 (= ~s~0 |old(~s~0)|)) (.cse10 (<= ~MPR3~0 6)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 6 ~MPR3~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse0 (or (not .cse10) (not .cse8) (not .cse9) (not (<= |old(~PagingReferenceCount~0)| 0)) (not .cse11) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not .cse6) (not .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (and (= 1 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) (= ~s~0 ~NP~0) .cse4 .cse5 .cse9 .cse6 .cse7)) (.cse3 (and (= 0 ~pended~0) .cse4 .cse5 .cse6 .cse7 (= 0 ~customIrp~0) .cse8 (<= ~s~0 ~NP~0) .cse9 (<= ~NP~0 1) (= 1 ~s~0) .cse10 (= |old(~customIrp~0)| ~customIrp~0) .cse11))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2 .cse3) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse2 .cse1 .cse3)))) [2019-09-07 13:02:45,983 INFO L443 ceAbstractionStarter]: For program point L294-1(lines 228 416) no Hoare annotation was computed. [2019-09-07 13:02:45,983 INFO L443 ceAbstractionStarter]: For program point L261-1(lines 261 262) no Hoare annotation was computed. [2019-09-07 13:02:45,983 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 423) no Hoare annotation was computed. [2019-09-07 13:02:45,983 INFO L439 ceAbstractionStarter]: At program point L369(line 369) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2019-09-07 13:02:45,983 INFO L443 ceAbstractionStarter]: For program point L369-1(line 369) no Hoare annotation was computed. [2019-09-07 13:02:45,983 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 276) no Hoare annotation was computed. [2019-09-07 13:02:45,983 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-09-07 13:02:45,984 INFO L443 ceAbstractionStarter]: For program point L427-2(lines 427 429) no Hoare annotation was computed. [2019-09-07 13:02:45,984 INFO L439 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:45,984 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 420) no Hoare annotation was computed. [2019-09-07 13:02:45,984 INFO L439 ceAbstractionStarter]: At program point L213(lines 209 424) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2))) [2019-09-07 13:02:45,984 INFO L439 ceAbstractionStarter]: At program point L304(line 304) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:45,985 INFO L443 ceAbstractionStarter]: For program point L304-1(lines 300 306) no Hoare annotation was computed. [2019-09-07 13:02:45,985 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2019-09-07 13:02:45,985 INFO L439 ceAbstractionStarter]: At program point L288(line 288) the Hoare annotation is: (let ((.cse4 (= 0 ~compRegistered~0))) (let ((.cse0 (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~pended~0) .cse4 (= ~s~0 |old(~s~0)|))) (.cse1 (and (= 1 ~pended~0) (= ~s~0 ~NP~0) .cse4)) (.cse2 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse3 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3) (or .cse0 .cse1 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse2 .cse3)))) [2019-09-07 13:02:45,985 INFO L439 ceAbstractionStarter]: At program point L255(line 255) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (< 0 ~PagingReferenceCount~0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2))) [2019-09-07 13:02:45,986 INFO L439 ceAbstractionStarter]: At program point L222(lines 221 420) the Hoare annotation is: (let ((.cse5 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0))) (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not .cse5) (not .cse6) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not .cse4) (not .cse3) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5 (<= (+ ~NP~0 5) ~MPR3~0) .cse6))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2019-09-07 13:02:45,986 INFO L443 ceAbstractionStarter]: For program point L255-1(line 255) no Hoare annotation was computed. [2019-09-07 13:02:45,986 INFO L439 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse8 (= ~SKIP1~0 ~s~0))) (let ((.cse0 (and (= 0 ~pended~0) .cse4 (= |old(~customIrp~0)| ~customIrp~0) .cse8)) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not .cse6) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not .cse7) (not .cse5) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (and (= 1 ~pended~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse4 .cse5 .cse6 .cse7 .cse8))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2 .cse3)))) [2019-09-07 13:02:45,986 INFO L443 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2019-09-07 13:02:45,986 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 245) no Hoare annotation was computed. [2019-09-07 13:02:45,986 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 425) no Hoare annotation was computed. [2019-09-07 13:02:45,987 INFO L439 ceAbstractionStarter]: At program point L363(line 363) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:45,987 INFO L443 ceAbstractionStarter]: For program point L396-1(lines 396 400) no Hoare annotation was computed. [2019-09-07 13:02:45,987 INFO L443 ceAbstractionStarter]: For program point L363-1(lines 359 365) no Hoare annotation was computed. [2019-09-07 13:02:45,987 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 266) no Hoare annotation was computed. [2019-09-07 13:02:45,987 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-09-07 13:02:45,987 INFO L443 ceAbstractionStarter]: For program point L264-2(lines 264 266) no Hoare annotation was computed. [2019-09-07 13:02:45,987 INFO L439 ceAbstractionStarter]: At program point L388(line 388) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0) (= ~SKIP1~0 ~s~0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2019-09-07 13:02:45,987 INFO L443 ceAbstractionStarter]: For program point L388-1(line 388) no Hoare annotation was computed. [2019-09-07 13:02:45,988 INFO L443 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 159 432) no Hoare annotation was computed. [2019-09-07 13:02:45,988 INFO L439 ceAbstractionStarter]: At program point L380(line 380) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:45,988 INFO L443 ceAbstractionStarter]: For program point L380-1(lines 376 382) no Hoare annotation was computed. [2019-09-07 13:02:45,988 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 422) no Hoare annotation was computed. [2019-09-07 13:02:45,988 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 344) no Hoare annotation was computed. [2019-09-07 13:02:45,988 INFO L443 ceAbstractionStarter]: For program point L339-2(lines 339 344) no Hoare annotation was computed. [2019-09-07 13:02:45,988 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 425) the Hoare annotation is: (let ((.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~PagingReferenceCount~0 1) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= 0 FloppyPnp_~ntStatus~0) (< 0 ~PagingReferenceCount~0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse0))) [2019-09-07 13:02:45,989 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 329) no Hoare annotation was computed. [2019-09-07 13:02:45,989 INFO L443 ceAbstractionStarter]: For program point L323-1(lines 318 330) no Hoare annotation was computed. [2019-09-07 13:02:45,989 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 419) no Hoare annotation was computed. [2019-09-07 13:02:45,989 INFO L439 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2019-09-07 13:02:45,989 INFO L443 ceAbstractionStarter]: For program point L414-1(line 414) no Hoare annotation was computed. [2019-09-07 13:02:45,989 INFO L439 ceAbstractionStarter]: At program point L249(line 249) the Hoare annotation is: (let ((.cse0 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2019-09-07 13:02:45,990 INFO L443 ceAbstractionStarter]: For program point L249-1(line 249) no Hoare annotation was computed. [2019-09-07 13:02:45,990 INFO L439 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:45,990 INFO L443 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 159 432) no Hoare annotation was computed. [2019-09-07 13:02:45,990 INFO L443 ceAbstractionStarter]: For program point L274-1(lines 270 276) no Hoare annotation was computed. [2019-09-07 13:02:45,990 INFO L439 ceAbstractionStarter]: At program point L398(line 398) the Hoare annotation is: (let ((.cse4 (= 0 ~pended~0)) (.cse5 (= 0 ~compRegistered~0)) (.cse6 (<= ~PagingReferenceCount~0 1)) (.cse7 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse8 (< 0 ~PagingReferenceCount~0))) (let ((.cse0 (and .cse4 .cse5 .cse6 .cse7 (= ~s~0 ~SKIP2~0) .cse8)) (.cse1 (and (= ~s~0 ~IPC~0) .cse4 .cse5 .cse6 .cse7 .cse8)) (.cse2 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse3 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 .cse1 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse2 .cse3) (or .cse0 .cse1 (not (= |old(~myStatus~0)| 0)) .cse2 .cse3)))) [2019-09-07 13:02:45,990 INFO L443 ceAbstractionStarter]: For program point L398-1(line 398) no Hoare annotation was computed. [2019-09-07 13:02:45,991 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 395) no Hoare annotation was computed. [2019-09-07 13:02:45,991 INFO L443 ceAbstractionStarter]: For program point L390-2(lines 228 416) no Hoare annotation was computed. [2019-09-07 13:02:45,991 INFO L439 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 159 432) the Hoare annotation is: (let ((.cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= 0 ~PagingReferenceCount~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (<= ~PagingReferenceCount~0 0))) (.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse2 .cse0 .cse1))) [2019-09-07 13:02:45,991 INFO L439 ceAbstractionStarter]: At program point L704(line 704) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (and (= main_~status~1 ~lowerDriverReturn~0) (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= ~MPR3~0 ~s~0) (= ~s~0 ~SKIP2~0) (<= 0 ~PagingReferenceCount~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (<= ~PagingReferenceCount~0 0) (<= ~s~0 ~MPR3~0) (= main_~status~1 0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-09-07 13:02:45,991 INFO L443 ceAbstractionStarter]: For program point L704-1(lines 700 837) no Hoare annotation was computed. [2019-09-07 13:02:45,991 INFO L443 ceAbstractionStarter]: For program point L795(lines 779 834) no Hoare annotation was computed. [2019-09-07 13:02:45,992 INFO L443 ceAbstractionStarter]: For program point L729(lines 729 777) no Hoare annotation was computed. [2019-09-07 13:02:45,992 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 666 838) no Hoare annotation was computed. [2019-09-07 13:02:45,992 INFO L443 ceAbstractionStarter]: For program point L812(lines 812 814) no Hoare annotation was computed. [2019-09-07 13:02:45,992 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 831) no Hoare annotation was computed. [2019-09-07 13:02:45,992 INFO L439 ceAbstractionStarter]: At program point L730(lines 729 777) the Hoare annotation is: (or (and (= main_~status~1 0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-09-07 13:02:45,992 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2019-09-07 13:02:45,992 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2019-09-07 13:02:45,992 INFO L439 ceAbstractionStarter]: At program point L747(lines 746 774) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-09-07 13:02:45,993 INFO L443 ceAbstractionStarter]: For program point L739(lines 739 775) no Hoare annotation was computed. [2019-09-07 13:02:45,993 INFO L439 ceAbstractionStarter]: At program point L706(lines 700 837) the Hoare annotation is: (let ((.cse2 (= main_~status~1 0)) (.cse1 (= ~s~0 ~IPC~0)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse7 (<= ~compRegistered~0 0)) (.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse5 (= 0 ~pended~0)) (.cse10 (= ~s~0 ~DC~0)) (.cse8 (= 1 ~pended~0)) (.cse13 (= ~s~0 ~SKIP2~0)) (.cse4 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse9 (= 0 ~compRegistered~0)) (.cse11 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse12 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (not (<= |old(~MaximumInterfaceType~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and .cse8 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse6) (and .cse8 .cse3 .cse4 (= ~s~0 ~NP~0) .cse9 .cse6) (not (<= |old(~PagingReferenceCount~0)| 0)) (and .cse2 .cse5 .cse10) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse0 (and .cse1 .cse4 .cse5 .cse11 .cse6 .cse12 .cse7)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse0 .cse13 .cse4 .cse5 .cse11 .cse6 .cse12 .cse7) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (and (and .cse3 .cse4 .cse5 .cse6 .cse10) (not (= main_~status~1 259))) (and .cse8 .cse13 .cse4 .cse9 .cse11 .cse6 .cse12))) [2019-09-07 13:02:45,993 INFO L443 ceAbstractionStarter]: For program point L797(lines 797 830) no Hoare annotation was computed. [2019-09-07 13:02:45,993 INFO L443 ceAbstractionStarter]: For program point L756(line 756) no Hoare annotation was computed. [2019-09-07 13:02:45,993 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 666 838) no Hoare annotation was computed. [2019-09-07 13:02:45,993 INFO L443 ceAbstractionStarter]: For program point L715(lines 715 718) no Hoare annotation was computed. [2019-09-07 13:02:45,994 INFO L439 ceAbstractionStarter]: At program point L715-2(lines 715 718) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= 1 ~s~0)) (.cse3 (<= 0 ~PagingReferenceCount~0)) (.cse4 (<= ~MPR3~0 6)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (<= 6 ~MPR3~0)) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (<= ~PagingReferenceCount~0 0)) (.cse11 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse12 (= main_~status~1 0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~myStatus~0 1073741637) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~myStatus~0 |old(~myStatus~0)|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|)))) [2019-09-07 13:02:45,994 INFO L439 ceAbstractionStarter]: At program point L740(lines 739 775) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~SKIP2~0 3) ~IPC~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= ~PagingReferenceCount~0 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= ~s~0 ~NP~0) (= main_~status~1 0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1) (= 1 ~s~0) (<= 0 ~PagingReferenceCount~0) (<= ~MPR3~0 6) (<= 6 ~MPR3~0)) (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-09-07 13:02:45,994 INFO L443 ceAbstractionStarter]: For program point L798(lines 798 808) no Hoare annotation was computed. [2019-09-07 13:02:45,994 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 666 838) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (and (= ~s~0 ~MPR1~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (<= ~MPR3~0 ~s~0) (= ~s~0 ~SKIP2~0) (<= 0 ~PagingReferenceCount~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0) (= ~s~0 ~IPC~0) (= ~s~0 ~NP~0) (= ~s~0 ~DC~0) (<= ~PagingReferenceCount~0 0) (<= ~s~0 ~MPR3~0) (<= ~MaximumInterfaceType~0 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-09-07 13:02:45,995 INFO L443 ceAbstractionStarter]: For program point L823(lines 823 827) no Hoare annotation was computed. [2019-09-07 13:02:45,995 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2019-09-07 13:02:45,995 INFO L443 ceAbstractionStarter]: For program point L766(line 766) no Hoare annotation was computed. [2019-09-07 13:02:45,995 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 828) no Hoare annotation was computed. [2019-09-07 13:02:45,995 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 776) no Hoare annotation was computed. [2019-09-07 13:02:45,995 INFO L439 ceAbstractionStarter]: At program point L825(line 825) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-09-07 13:02:45,995 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2019-09-07 13:02:45,996 INFO L443 ceAbstractionStarter]: For program point L751(line 751) no Hoare annotation was computed. [2019-09-07 13:02:45,996 INFO L439 ceAbstractionStarter]: At program point L801(line 801) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-09-07 13:02:45,996 INFO L439 ceAbstractionStarter]: At program point L735(lines 734 776) the Hoare annotation is: (or (and (= main_~status~1 0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-09-07 13:02:45,996 INFO L439 ceAbstractionStarter]: At program point L810(lines 797 830) the Hoare annotation is: (let ((.cse6 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ~s~0 ~DC~0))) (let ((.cse5 (and .cse6 .cse7 .cse8 .cse4))) (let ((.cse9 (or (and (= main_~status~1 ~lowerDriverReturn~0) .cse6 .cse7 .cse8 (<= ~compRegistered~0 0)) .cse5))) (let ((.cse2 (not (= main_~status~1 259))) (.cse0 (and (and .cse9 (<= (+ ~SKIP2~0 3) ~IPC~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (= main_~status~1 0))) (or (and (and (and (let ((.cse1 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 (<= ~PagingReferenceCount~0 1) .cse1 (< 0 ~PagingReferenceCount~0)) (and .cse0 (<= 0 ~PagingReferenceCount~0) (<= ~PagingReferenceCount~0 0) .cse1))) (<= 1 ~NP~0)) (<= ~MPR3~0 6)) .cse2) (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (<= (+ main_~status~1 1073741536) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (and .cse3 .cse4) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse5 .cse2) (not (<= |old(~PagingReferenceCount~0)| 0)) (and .cse0 (<= ~SKIP2~0 ~s~0)) (and (= 1 ~pended~0) .cse6 .cse7 .cse8) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (and .cse3 .cse9) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))))))) [2019-09-07 13:02:45,996 INFO L443 ceAbstractionStarter]: For program point L744(lines 744 774) no Hoare annotation was computed. [2019-09-07 13:02:45,997 INFO L439 ceAbstractionStarter]: At program point L794(lines 787 833) the Hoare annotation is: (let ((.cse5 (= 1 ~pended~0)) (.cse2 (= ~s~0 ~SKIP2~0)) (.cse3 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse4 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= main_~status~1 ~lowerDriverReturn~0)) (.cse9 (= ~s~0 ~IPC~0)) (.cse0 (= main_~status~1 0)) (.cse8 (<= ~compRegistered~0 0)) (.cse10 (<= (+ ~DC~0 5) ~IPC~0)) (.cse6 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse7 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse1 (= ~s~0 ~DC~0))) (or (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and .cse0 .cse1) (and .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8)) (not (<= |old(~PagingReferenceCount~0)| 0)) (and .cse9 .cse5 .cse10 .cse6 .cse7 .cse8) (and .cse11 .cse9 .cse6 .cse3 .cse7 .cse4 .cse8) (and .cse5 .cse10 .cse6 .cse7 .cse1) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse11 (and .cse2 .cse6 .cse3 .cse7 .cse4 .cse8)) (and .cse11 .cse9 .cse0 .cse10 .cse6 .cse7 .cse8) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (and .cse10 .cse6 .cse7 .cse1) (not (= main_~status~1 259))) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)))) [2019-09-07 13:02:45,997 INFO L443 ceAbstractionStarter]: For program point L761(line 761) no Hoare annotation was computed. [2019-09-07 13:02:45,997 INFO L439 ceAbstractionStarter]: At program point L819(line 819) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|))) [2019-09-07 13:02:45,998 INFO L439 ceAbstractionStarter]: At program point L786(lines 779 834) the Hoare annotation is: (let ((.cse9 (= main_~status~1 0)) (.cse0 (= 1 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse8 (= ~s~0 ~IPC~0)) (.cse7 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (= ~s~0 ~SKIP2~0)) (.cse5 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse12 (<= ~compRegistered~0 0)) (.cse10 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= 0 ~pended~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse13 (= ~s~0 ~DC~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= |old(~MaximumInterfaceType~0)| 0)) (and .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse12) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and .cse0 .cse10 .cse2 .cse3 .cse4 .cse13) (not (<= |old(~PagingReferenceCount~0)| 0)) (and .cse9 .cse11 .cse13) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|)) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse8 .cse0 .cse2 .cse10 .cse3 .cse4) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (= |old(~compRegistered~0)| 0)) (and .cse7 (and .cse8 .cse2 .cse11 .cse5 .cse4 .cse6 .cse12)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse7 .cse1 .cse2 .cse11 .cse5 .cse4 .cse6 .cse12) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (and (and .cse10 .cse2 .cse11 .cse4 .cse13) (not (= main_~status~1 259))))) [2019-09-07 13:02:45,998 INFO L443 ceAbstractionStarter]: For program point L720(lines 706 778) no Hoare annotation was computed. [2019-09-07 13:02:45,998 INFO L439 ceAbstractionStarter]: At program point L745(lines 744 774) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= 1 ~s~0)) (.cse3 (<= 0 ~PagingReferenceCount~0)) (.cse4 (<= ~MPR3~0 6)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (<= 6 ~MPR3~0)) (.cse7 (= ~s~0 ~NP~0)) (.cse8 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse9 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse10 (<= ~PagingReferenceCount~0 0)) (.cse11 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse12 (= main_~status~1 0)) (.cse13 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (<= ~MaximumInterfaceType~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~myStatus~0 1073741637) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~myStatus~0)| 0)) (not (<= |old(~MaximumInterfaceType~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~myStatus~0 |old(~myStatus~0)|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (<= |old(~s~0)| |old(~MPR3~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (not (<= |old(~MPR3~0)| |old(~s~0)|)))) [2019-09-07 13:02:45,998 INFO L439 ceAbstractionStarter]: At program point L1176(line 1176) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2019-09-07 13:02:45,998 INFO L443 ceAbstractionStarter]: For program point L1176-1(line 1176) no Hoare annotation was computed. [2019-09-07 13:02:45,998 INFO L443 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1167 1180) no Hoare annotation was computed. [2019-09-07 13:02:45,998 INFO L439 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 1167 1180) the Hoare annotation is: (or (= ~s~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0))) [2019-09-07 13:02:45,999 INFO L443 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 1167 1180) no Hoare annotation was computed. [2019-09-07 13:02:45,999 INFO L439 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~setEventCalled~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~setEventCalled~0 1))))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:45,999 INFO L443 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2019-09-07 13:02:45,999 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 951 964) the Hoare annotation is: (let ((.cse0 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= 1 ~setEventCalled~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (<= ~setEventCalled~0 1)))) (.cse1 (= ~s~0 ~NP~0))) (and (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse0 .cse1 .cse2) (or (not (= ~myStatus~0 0)) .cse0 .cse2 .cse1))) [2019-09-07 13:02:45,999 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 951 964) no Hoare annotation was computed. [2019-09-07 13:02:45,999 INFO L446 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: true [2019-09-07 13:02:46,000 INFO L443 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2019-09-07 13:02:46,000 INFO L446 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 601 610) the Hoare annotation is: true [2019-09-07 13:02:46,000 INFO L443 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 601 610) no Hoare annotation was computed. [2019-09-07 13:02:46,000 INFO L443 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 601 610) no Hoare annotation was computed. [2019-09-07 13:02:46,000 INFO L439 ceAbstractionStarter]: At program point L1088(lines 1087 1099) the Hoare annotation is: (let ((.cse36 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse34 (<= 1 ~compRegistered~0)) (.cse30 (= 0 ~pended~0)) (.cse31 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse33 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse28 (= 1 ~s~0)) (.cse37 (<= ~NP~0 1)) (.cse39 (< 0 ~PagingReferenceCount~0)) (.cse40 (<= 6 ~MPR3~0)) (.cse32 (<= ~PagingReferenceCount~0 1)) (.cse10 (not .cse33)) (.cse11 (not .cse31)) (.cse13 (not .cse30)) (.cse16 (not .cse34)) (.cse6 (not .cse36)) (.cse35 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse38 (<= ~MPR3~0 6))) (let ((.cse4 (not .cse38)) (.cse12 (not (<= 1 |old(~setEventCalled~0)|))) (.cse21 (not (<= 1 ~NP~0))) (.cse24 (not (<= |old(~s~0)| ~MPR3~0))) (.cse5 (not .cse35)) (.cse22 (or .cse10 (or .cse11 (or .cse13 .cse16 .cse6)))) (.cse14 (not .cse32)) (.cse7 (not .cse40)) (.cse15 (not .cse39)) (.cse23 (not .cse37)) (.cse26 (not (<= ~MPR3~0 |old(~s~0)|))) (.cse17 (not (<= |old(~setEventCalled~0)| 1))) (.cse19 (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (not (= ~MPR3~0 |old(~s~0)|)) (<= ~s~0 ~NP~0) .cse36 .cse37 .cse28 .cse38 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) .cse39 .cse40)) (.cse29 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse1 (not (= ~myStatus~0 0))) (.cse20 (and .cse19 .cse29)) (.cse8 (not (= 1 |old(~s~0)|))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse27 (not (= ~compRegistered~0 0))) (.cse25 (not (= |old(~customIrp~0)| 0))) (.cse0 (and .cse28 .cse29)) (.cse18 (not (<= (+ ~myStatus~0 1073741637) 0))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (or .cse4 .cse12 .cse21 .cse24 .cse5 .cse22 .cse14 .cse7 .cse15 .cse23 .cse26 .cse17))) (and (or .cse0 .cse1 .cse2 .cse3) (or (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 (or (and (= |old(~customIrp~0)| 1) .cse19 (= 0 ~customIrp~0)) .cse20) .cse2) (or .cse4 .cse21 .cse1 .cse5 .cse22 .cse7 .cse23 .cse0 .cse12 .cse24 .cse14 .cse15 .cse25 .cse26 .cse17) (or .cse4 .cse1 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) .cse9 .cse10 .cse11 .cse27 .cse6) (or .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse13 .cse25) (or .cse0 .cse18 .cse2 .cse3)))))) [2019-09-07 13:02:46,000 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1060 1101) no Hoare annotation was computed. [2019-09-07 13:02:46,001 INFO L439 ceAbstractionStarter]: At program point L1080(line 1080) the Hoare annotation is: (let ((.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= 0 ~pended~0))) (.cse12 (not (<= 1 ~compRegistered~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse8 (not (<= 1 |old(~setEventCalled~0)|))) (.cse17 (not (<= 1 ~NP~0))) (.cse21 (not (<= |old(~s~0)| ~MPR3~0))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse19 (or .cse6 (or .cse7 (or .cse9 .cse12 .cse2)))) (.cse10 (not (<= ~PagingReferenceCount~0 1))) (.cse3 (not (<= 6 ~MPR3~0))) (.cse11 (not (< 0 ~PagingReferenceCount~0))) (.cse20 (not (<= ~NP~0 1))) (.cse23 (not (<= ~MPR3~0 |old(~s~0)|))) (.cse13 (not (<= |old(~setEventCalled~0)| 1)))) (let ((.cse16 (not (= ~compRegistered~0 0))) (.cse14 (not (<= (+ ~myStatus~0 1073741637) 0))) (.cse15 (not (<= ~MaximumInterfaceType~0 0))) (.cse24 (or .cse0 .cse8 .cse17 .cse21 .cse1 .cse19 .cse10 .cse3 .cse11 .cse20 .cse23 .cse13)) (.cse18 (not (= ~myStatus~0 0))) (.cse4 (not (= 1 |old(~s~0)|))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse22 (not (= |old(~customIrp~0)| 0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 1 ~pended~0)) .cse5 .cse6 .cse7 .cse16 .cse2) (or .cse0 .cse17 .cse18 .cse1 .cse19 .cse3 .cse20 .cse8 .cse21 .cse10 .cse11 .cse22 .cse23 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse9 .cse22) (or .cse18 .cse15 .cse24) (or .cse14 .cse15 .cse24) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse13))))) [2019-09-07 13:02:46,001 INFO L443 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2019-09-07 13:02:46,001 INFO L443 ceAbstractionStarter]: For program point L1078-1(lines 1065 1084) no Hoare annotation was computed. [2019-09-07 13:02:46,001 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1071) no Hoare annotation was computed. [2019-09-07 13:02:46,001 INFO L443 ceAbstractionStarter]: For program point L1087(lines 1087 1099) no Hoare annotation was computed. [2019-09-07 13:02:46,001 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 1060 1101) no Hoare annotation was computed. [2019-09-07 13:02:46,002 INFO L439 ceAbstractionStarter]: At program point L1073(lines 1065 1084) the Hoare annotation is: (let ((.cse18 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse19 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse24 (not (= 0 ~pended~0))) (.cse25 (not (<= 1 ~compRegistered~0))) (.cse21 (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (let ((.cse26 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (not (<= ~MPR3~0 6))) (.cse7 (not (<= 1 |old(~setEventCalled~0)|))) (.cse1 (not (<= 1 ~NP~0))) (.cse8 (not (<= |old(~s~0)| ~MPR3~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (or .cse18 (or .cse19 (or .cse24 .cse25 .cse21)))) (.cse9 (not (<= ~PagingReferenceCount~0 1))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse10 (not (< 0 ~PagingReferenceCount~0))) (.cse6 (not (<= ~NP~0 1))) (.cse12 (not (<= ~MPR3~0 |old(~s~0)|))) (.cse13 (not (<= |old(~setEventCalled~0)| 1)))) (let ((.cse15 (or .cse0 .cse7 .cse1 .cse8 .cse3 .cse4 .cse9 .cse5 .cse10 .cse6 .cse12 .cse13)) (.cse2 (not (= ~myStatus~0 0))) (.cse20 (not (= ~compRegistered~0 0))) (.cse11 (not (= |old(~customIrp~0)| 0))) (.cse23 (not (= 1 |old(~s~0)|))) (.cse17 (not (= |old(~s~0)| ~NP~0))) (.cse16 (not (<= (+ ~myStatus~0 1073741637) 0))) (.cse14 (not (<= ~MaximumInterfaceType~0 0))) (.cse22 (and .cse26 (<= 1 ~setEventCalled~0) (= ~s~0 ~NP~0) (<= ~setEventCalled~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse2 .cse14 .cse15) (or .cse16 .cse14 .cse15) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 1 ~pended~0)) .cse17 .cse18 .cse19 (= ~s~0 |old(~s~0)|) .cse20 .cse21) (or .cse0 .cse22 .cse2 .cse3 .cse21 .cse5 .cse23 .cse17 .cse18 .cse19 .cse7 .cse24 .cse9 .cse10 .cse25 .cse11 .cse13) (or .cse0 .cse3 .cse21 .cse5 .cse23 (and (= 1 ~s~0) .cse26) .cse17 .cse18 .cse19 .cse20 .cse24 .cse11) (or (or .cse0 .cse3 .cse21 .cse5 .cse23 .cse17 .cse18 .cse19 .cse7 .cse24 .cse9 .cse10 .cse25 .cse13) .cse16 .cse14 .cse22))))) [2019-09-07 13:02:46,002 INFO L443 ceAbstractionStarter]: For program point L1065(lines 1065 1084) no Hoare annotation was computed. [2019-09-07 13:02:46,002 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1060 1101) the Hoare annotation is: (let ((.cse19 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse20 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse26 (not (= 0 ~pended~0))) (.cse29 (not (<= 1 ~compRegistered~0))) (.cse22 (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse8 (not (<= 1 |old(~setEventCalled~0)|))) (.cse1 (not (<= 1 ~NP~0))) (.cse9 (not (<= |old(~s~0)| ~MPR3~0))) (.cse4 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (or .cse19 (or .cse20 (or .cse26 .cse29 .cse22)))) (.cse10 (not (<= ~PagingReferenceCount~0 1))) (.cse6 (not (<= 6 ~MPR3~0))) (.cse11 (not (< 0 ~PagingReferenceCount~0))) (.cse7 (not (<= ~NP~0 1))) (.cse13 (not (<= ~MPR3~0 |old(~s~0)|))) (.cse14 (not (<= |old(~setEventCalled~0)| 1))) (.cse25 (= |old(~customIrp~0)| ~customIrp~0)) (.cse27 (<= 1 ~setEventCalled~0)) (.cse28 (<= ~setEventCalled~0 1))) (let ((.cse3 (and (<= ~MPR3~0 ~s~0) (<= ~s~0 ~MPR3~0) .cse25 .cse27 .cse28)) (.cse17 (or .cse0 .cse8 .cse1 .cse9 .cse4 .cse5 .cse10 .cse6 .cse11 .cse7 .cse13 .cse14)) (.cse21 (not (= ~compRegistered~0 0))) (.cse24 (= 1 ~s~0)) (.cse2 (not (= ~myStatus~0 0))) (.cse12 (not (= |old(~customIrp~0)| 0))) (.cse23 (not (= 1 |old(~s~0)|))) (.cse18 (not (= |old(~s~0)| ~NP~0))) (.cse15 (not (<= (+ ~myStatus~0 1073741637) 0))) (.cse16 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse16 .cse17 .cse3) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 1 ~pended~0)) .cse18 .cse19 .cse20 (= ~s~0 |old(~s~0)|) .cse21 .cse22) (or .cse3 .cse2 .cse16 .cse17) (or .cse0 .cse4 .cse22 .cse6 .cse23 (and .cse24 .cse25) .cse18 .cse19 .cse20 .cse21 .cse26 .cse12) (or .cse0 (and .cse24 .cse25 .cse27 .cse28) .cse2 .cse4 .cse22 .cse6 .cse23 .cse18 .cse19 .cse20 .cse8 .cse26 .cse10 .cse11 .cse29 .cse12 .cse14) (or (or .cse0 .cse4 .cse22 .cse6 .cse23 .cse18 .cse19 .cse20 .cse8 .cse26 .cse10 .cse11 .cse29 .cse14) .cse15 .cse16 (and .cse25 .cse27 (= ~s~0 ~NP~0) .cse28)))))) [2019-09-07 13:02:46,003 INFO L439 ceAbstractionStarter]: At program point L1090(lines 1089 1099) the Hoare annotation is: (let ((.cse36 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse34 (<= 1 ~compRegistered~0)) (.cse30 (= 0 ~pended~0)) (.cse31 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse33 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (let ((.cse28 (= 1 ~s~0)) (.cse37 (<= ~NP~0 1)) (.cse39 (< 0 ~PagingReferenceCount~0)) (.cse40 (<= 6 ~MPR3~0)) (.cse32 (<= ~PagingReferenceCount~0 1)) (.cse10 (not .cse33)) (.cse11 (not .cse31)) (.cse13 (not .cse30)) (.cse16 (not .cse34)) (.cse6 (not .cse36)) (.cse35 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse38 (<= ~MPR3~0 6))) (let ((.cse4 (not .cse38)) (.cse12 (not (<= 1 |old(~setEventCalled~0)|))) (.cse21 (not (<= 1 ~NP~0))) (.cse24 (not (<= |old(~s~0)| ~MPR3~0))) (.cse5 (not .cse35)) (.cse22 (or .cse10 (or .cse11 (or .cse13 .cse16 .cse6)))) (.cse14 (not .cse32)) (.cse7 (not .cse40)) (.cse15 (not .cse39)) (.cse23 (not .cse37)) (.cse26 (not (<= ~MPR3~0 |old(~s~0)|))) (.cse17 (not (<= |old(~setEventCalled~0)| 1))) (.cse19 (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (not (= ~MPR3~0 |old(~s~0)|)) (<= ~s~0 ~NP~0) .cse36 .cse37 .cse28 .cse38 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1) .cse39 .cse40)) (.cse29 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse1 (not (= ~myStatus~0 0))) (.cse20 (and .cse19 .cse29)) (.cse8 (not (= 1 |old(~s~0)|))) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse27 (not (= ~compRegistered~0 0))) (.cse25 (not (= |old(~customIrp~0)| 0))) (.cse0 (and .cse28 .cse29)) (.cse18 (not (<= (+ ~myStatus~0 1073741637) 0))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (or .cse4 .cse12 .cse21 .cse24 .cse5 .cse22 .cse14 .cse7 .cse15 .cse23 .cse26 .cse17))) (and (or .cse0 .cse1 .cse2 .cse3) (or (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 (or (and (= |old(~customIrp~0)| 1) .cse19 (= 0 ~customIrp~0)) .cse20) .cse2) (or .cse4 .cse21 .cse1 .cse5 .cse22 .cse7 .cse23 .cse0 .cse12 .cse24 .cse14 .cse15 .cse25 .cse26 .cse17) (or .cse4 .cse1 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) .cse9 .cse10 .cse11 .cse27 .cse6) (or .cse4 .cse0 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse13 .cse25) (or .cse0 .cse18 .cse2 .cse3)))))) [2019-09-07 13:02:46,003 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1038 1051) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse2 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (= 0 ~pended~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 1 ~pended~0)) .cse0 .cse1 .cse2 .cse4 (not (<= (+ ~DC~0 5) ~IPC~0))) (or (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse4 (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (or .cse1 .cse3) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0))) (= 1 ~s~0)))) [2019-09-07 13:02:46,003 INFO L439 ceAbstractionStarter]: At program point L1046(line 1046) the Hoare annotation is: (let ((.cse2 (not (= 0 ~pended~0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (= ~compRegistered~0 0))) (.cse0 (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (and (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse0 (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (or .cse1 .cse2) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0))) (or .cse1 .cse3 .cse2) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 1 ~pended~0)) .cse1 .cse3 .cse0 (not (<= (+ ~DC~0 5) ~IPC~0))))) [2019-09-07 13:02:46,004 INFO L443 ceAbstractionStarter]: For program point L1046-1(lines 1038 1051) no Hoare annotation was computed. [2019-09-07 13:02:46,004 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1038 1051) no Hoare annotation was computed. [2019-09-07 13:02:46,004 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1048) no Hoare annotation was computed. [2019-09-07 13:02:46,004 INFO L443 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 433 600) no Hoare annotation was computed. [2019-09-07 13:02:46,004 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2019-09-07 13:02:46,004 INFO L439 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 433 600) the Hoare annotation is: (let ((.cse0 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (= 0 ~compRegistered~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2))) [2019-09-07 13:02:46,004 INFO L439 ceAbstractionStarter]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= 1 ~compRegistered~0) (= 1 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2))) [2019-09-07 13:02:46,005 INFO L443 ceAbstractionStarter]: For program point L507-1(line 507) no Hoare annotation was computed. [2019-09-07 13:02:46,005 INFO L439 ceAbstractionStarter]: At program point L532(line 532) the Hoare annotation is: (let ((.cse0 (and (< 0 (+ FloppyStartDevice_~ntStatus~1 1)) (= ~myStatus~0 |old(~myStatus~0)|) (and (<= 1 ~compRegistered~0) (= 1 ~s~0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2))) [2019-09-07 13:02:46,005 INFO L443 ceAbstractionStarter]: For program point L532-1(line 532) no Hoare annotation was computed. [2019-09-07 13:02:46,005 INFO L439 ceAbstractionStarter]: At program point L557(lines 557 559) the Hoare annotation is: (let ((.cse0 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:46,005 INFO L443 ceAbstractionStarter]: For program point L557-1(lines 557 559) no Hoare annotation was computed. [2019-09-07 13:02:46,006 INFO L439 ceAbstractionStarter]: At program point L549-2(lines 549 565) the Hoare annotation is: (let ((.cse9 (<= ~MPR3~0 6)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 6 ~MPR3~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse5 (<= ~PagingReferenceCount~0 1)) (.cse10 (< 0 ~PagingReferenceCount~0)) (.cse12 (<= ~MaximumInterfaceType~0 0))) (let ((.cse0 (not .cse12)) (.cse1 (or (not .cse9) (not .cse7) (not .cse8) (not .cse11) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse6) (not .cse4) (not (= |old(~compRegistered~0)| 0)) (not .cse3) (not .cse5) (not .cse10) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (<= 0 FloppyStartDevice_~InterfaceType~0) (and (and .cse3 .cse4 .cse5 .cse6 (<= 1 ~compRegistered~0) .cse7 (<= ~s~0 ~NP~0) .cse8 (<= ~NP~0 1) (= 1 ~s~0) .cse9 .cse10 .cse11) (not (= FloppyStartDevice_~ntStatus~1 259)) (= ~myStatus~0 |old(~myStatus~0)|)) .cse12))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2)))) [2019-09-07 13:02:46,006 INFO L439 ceAbstractionStarter]: At program point L566(lines 527 592) the Hoare annotation is: (let ((.cse9 (<= ~MPR3~0 6)) (.cse7 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse11 (<= 6 ~MPR3~0)) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse3 (= 0 ~pended~0)) (.cse5 (<= ~PagingReferenceCount~0 1)) (.cse10 (< 0 ~PagingReferenceCount~0))) (let ((.cse0 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (or (not .cse9) (not .cse7) (not .cse8) (not .cse11) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not .cse6) (not .cse4) (not (= |old(~compRegistered~0)| 0)) (not .cse3) (not .cse5) (not .cse10) (not (= |old(~customIrp~0)| 0)))) (.cse2 (and (and .cse3 .cse4 .cse5 .cse6 (<= 1 ~compRegistered~0) .cse7 (<= ~s~0 ~NP~0) .cse8 (<= ~NP~0 1) (= 1 ~s~0) .cse9 .cse10 .cse11) (not (= FloppyStartDevice_~ntStatus~1 259)) (= ~myStatus~0 |old(~myStatus~0)|)))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2) (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2)))) [2019-09-07 13:02:46,006 INFO L439 ceAbstractionStarter]: At program point L525(line 525) the Hoare annotation is: (let ((.cse0 (and (let ((.cse3 (<= 1 ~compRegistered~0)) (.cse4 (= 1 ~s~0)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0))) (or (and .cse3 .cse4 .cse5 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (and .cse3 (<= FloppyStartDevice_~__cil_tmp42~0 259) .cse4 (< 258 FloppyStartDevice_~__cil_tmp42~0) .cse5))) (= ~myStatus~0 |old(~myStatus~0)|))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2))) [2019-09-07 13:02:46,006 INFO L439 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:46,007 INFO L443 ceAbstractionStarter]: For program point L525-1(line 525) no Hoare annotation was computed. [2019-09-07 13:02:46,007 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 588) no Hoare annotation was computed. [2019-09-07 13:02:46,007 INFO L443 ceAbstractionStarter]: For program point L550(lines 549 565) no Hoare annotation was computed. [2019-09-07 13:02:46,007 INFO L443 ceAbstractionStarter]: For program point L583-2(lines 583 588) no Hoare annotation was computed. [2019-09-07 13:02:46,007 INFO L439 ceAbstractionStarter]: At program point L542(lines 529 569) the Hoare annotation is: (let ((.cse0 (let ((.cse3 (and (<= 1 ~compRegistered~0) (= 1 ~s~0))) (.cse4 (= ~myStatus~0 |old(~myStatus~0)|))) (or (and .cse3 (= FloppyStartDevice_~ntStatus~1 |old(~myStatus~0)|) .cse4) (and (= FloppyStartDevice_~ntStatus~1 0) .cse3 .cse4)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or (and (< 0 (+ FloppyStartDevice_~ntStatus~1 1)) .cse0) (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 .cse2))) [2019-09-07 13:02:46,007 INFO L443 ceAbstractionStarter]: For program point L534(lines 534 537) no Hoare annotation was computed. [2019-09-07 13:02:46,007 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 543 546) no Hoare annotation was computed. [2019-09-07 13:02:46,008 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 592) no Hoare annotation was computed. [2019-09-07 13:02:46,008 INFO L443 ceAbstractionStarter]: For program point L527-1(lines 527 592) no Hoare annotation was computed. [2019-09-07 13:02:46,008 INFO L443 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 433 600) no Hoare annotation was computed. [2019-09-07 13:02:46,008 INFO L439 ceAbstractionStarter]: At program point L585(lines 585 586) the Hoare annotation is: (let ((.cse0 (and (not (= FloppyStartDevice_~ntStatus~1 259)) (and (< 0 (+ FloppyStartDevice_~ntStatus~1 1)) (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (= ~myStatus~0 |old(~myStatus~0)|))))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2))) [2019-09-07 13:02:46,008 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 585 586) no Hoare annotation was computed. [2019-09-07 13:02:46,008 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 516) no Hoare annotation was computed. [2019-09-07 13:02:46,008 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 511 516) no Hoare annotation was computed. [2019-09-07 13:02:46,008 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2019-09-07 13:02:46,009 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 501) no Hoare annotation was computed. [2019-09-07 13:02:46,009 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 490 502) no Hoare annotation was computed. [2019-09-07 13:02:46,009 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 569) no Hoare annotation was computed. [2019-09-07 13:02:46,009 INFO L439 ceAbstractionStarter]: At program point L513(line 513) the Hoare annotation is: (let ((.cse4 (= ~myStatus~0 |old(~myStatus~0)|)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (<= 1 ~setEventCalled~0)) (.cse7 (<= 1 ~compRegistered~0)) (.cse8 (<= FloppyStartDevice_~__cil_tmp42~0 259)) (.cse9 (< 258 FloppyStartDevice_~__cil_tmp42~0)) (.cse10 (<= ~setEventCalled~0 1))) (let ((.cse3 (and (<= ~MPR3~0 ~s~0) .cse4 .cse5 .cse6 .cse7 (<= ~s~0 ~MPR3~0) .cse8 .cse9 .cse10)) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0)))) (.cse0 (and .cse4 .cse5 .cse6 (= ~s~0 ~NP~0) .cse7 .cse8 .cse9 .cse10))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse3 .cse1 .cse2 .cse0)))) [2019-09-07 13:02:46,009 INFO L443 ceAbstractionStarter]: For program point L513-1(line 513) no Hoare annotation was computed. [2019-09-07 13:02:46,009 INFO L443 ceAbstractionStarter]: For program point L571(lines 571 578) no Hoare annotation was computed. [2019-09-07 13:02:46,010 INFO L439 ceAbstractionStarter]: At program point L571-2(lines 571 578) the Hoare annotation is: (let ((.cse0 (and (and (< 0 (+ FloppyStartDevice_~ntStatus~1 1)) (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (= ~myStatus~0 |old(~myStatus~0)|))) (not (= FloppyStartDevice_~ntStatus~1 259)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2))) [2019-09-07 13:02:46,010 INFO L439 ceAbstractionStarter]: At program point L596(line 596) the Hoare annotation is: (let ((.cse0 (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (not (= FloppyStartDevice_~ntStatus~1 259)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0))))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1 .cse2))) [2019-09-07 13:02:46,010 INFO L443 ceAbstractionStarter]: For program point L596-1(line 596) no Hoare annotation was computed. [2019-09-07 13:02:46,010 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 540) no Hoare annotation was computed. [2019-09-07 13:02:46,010 INFO L439 ceAbstractionStarter]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (= |old(~customIrp~0)| 0))))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1) (or (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse0 .cse1))) [2019-09-07 13:02:46,010 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 581) no Hoare annotation was computed. [2019-09-07 13:02:46,010 INFO L446 ceAbstractionStarter]: At program point L1134(lines 1133 1143) the Hoare annotation is: true [2019-09-07 13:02:46,011 INFO L443 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1124 1145) no Hoare annotation was computed. [2019-09-07 13:02:46,011 INFO L446 ceAbstractionStarter]: At program point L1132(lines 1131 1143) the Hoare annotation is: true [2019-09-07 13:02:46,011 INFO L443 ceAbstractionStarter]: For program point L1131(lines 1131 1143) no Hoare annotation was computed. [2019-09-07 13:02:46,011 INFO L446 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1124 1145) the Hoare annotation is: true [2019-09-07 13:02:46,011 INFO L443 ceAbstractionStarter]: For program point PsCreateSystemThreadFINAL(lines 1124 1145) no Hoare annotation was computed. [2019-09-07 13:02:46,011 INFO L443 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1102 1123) no Hoare annotation was computed. [2019-09-07 13:02:46,011 INFO L446 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1102 1123) the Hoare annotation is: true [2019-09-07 13:02:46,011 INFO L443 ceAbstractionStarter]: For program point ObReferenceObjectByHandleFINAL(lines 1102 1123) no Hoare annotation was computed. [2019-09-07 13:02:46,011 INFO L446 ceAbstractionStarter]: At program point L1112(lines 1111 1121) the Hoare annotation is: true [2019-09-07 13:02:46,012 INFO L446 ceAbstractionStarter]: At program point L1110(lines 1109 1121) the Hoare annotation is: true [2019-09-07 13:02:46,012 INFO L443 ceAbstractionStarter]: For program point L1109(lines 1109 1121) no Hoare annotation was computed. [2019-09-07 13:02:46,012 INFO L443 ceAbstractionStarter]: For program point L849(lines 849 861) no Hoare annotation was computed. [2019-09-07 13:02:46,012 INFO L443 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 839 863) no Hoare annotation was computed. [2019-09-07 13:02:46,012 INFO L443 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 839 863) no Hoare annotation was computed. [2019-09-07 13:02:46,012 INFO L439 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 839 863) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 ~s~0)) (or (not (= ~s~0 ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (= |old(~customIrp~0)| ~customIrp~0))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2))) [2019-09-07 13:02:46,012 INFO L446 ceAbstractionStarter]: At program point L852(lines 851 861) the Hoare annotation is: true [2019-09-07 13:02:46,013 INFO L446 ceAbstractionStarter]: At program point L850(lines 849 861) the Hoare annotation is: true [2019-09-07 13:02:46,013 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1052 1059) the Hoare annotation is: true [2019-09-07 13:02:46,013 INFO L443 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 1052 1059) no Hoare annotation was computed. [2019-09-07 13:02:46,013 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1052 1059) no Hoare annotation was computed. [2019-09-07 13:02:46,013 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 653 665) no Hoare annotation was computed. [2019-09-07 13:02:46,013 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 653 665) the Hoare annotation is: (let ((.cse2 (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0))) (.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~PagingReferenceCount~0 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 ~PagingReferenceCount~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or (not (= ~myStatus~0 0)) .cse0 .cse1 .cse2) (or (not (<= (+ ~myStatus~0 1073741637) 0)) .cse2 .cse0 .cse1))) [2019-09-07 13:02:46,013 INFO L443 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 653 665) no Hoare annotation was computed. [2019-09-07 13:02:46,014 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1626) no Hoare annotation was computed. [2019-09-07 13:02:46,014 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 1622 1629) the Hoare annotation is: true [2019-09-07 13:02:46,014 INFO L443 ceAbstractionStarter]: For program point errorFnFINAL(lines 1622 1629) no Hoare annotation was computed. [2019-09-07 13:02:46,014 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 1622 1629) no Hoare annotation was computed. [2019-09-07 13:02:46,014 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 135) no Hoare annotation was computed. [2019-09-07 13:02:46,014 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-09-07 13:02:46,015 INFO L439 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (<= 6 ~MPR3~0))) (.cse4 (not (= 1 ~s~0))) (.cse5 (not (= ~s~0 ~NP~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (<= |old(~PagingReferenceCount~0)| 1)) (not (< 0 |old(~PagingReferenceCount~0)|)) (not (= ~customIrp~0 0))) (or .cse0 .cse1 .cse2 (not (<= |old(~PagingReferenceCount~0)| 0)) .cse3 .cse4 .cse5 (not (<= 0 |old(~PagingReferenceCount~0)|)) .cse6 .cse7 .cse8 .cse9))) [2019-09-07 13:02:46,015 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 122) no Hoare annotation was computed. [2019-09-07 13:02:46,015 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 149 155) no Hoare annotation was computed. [2019-09-07 13:02:46,015 INFO L439 ceAbstractionStarter]: At program point L120-2(lines 120 122) the Hoare annotation is: (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse3 (not (<= 6 ~MPR3~0))) (.cse5 (not (= 1 ~s~0))) (.cse6 (not (= ~s~0 ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse4 (= 0 ~pended~0)) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= |old(~PagingReferenceCount~0)| 0)) .cse3 (and .cse4 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse5 .cse6 (not (<= 0 |old(~PagingReferenceCount~0)|)) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (and .cse4 (not (= 1 ~PagingReferenceCount~0))) .cse9 .cse10 (not (<= |old(~PagingReferenceCount~0)| 1)) (not (< 0 |old(~PagingReferenceCount~0)|)) (not (= ~customIrp~0 0))))) [2019-09-07 13:02:46,015 INFO L443 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 96 158) no Hoare annotation was computed. [2019-09-07 13:02:46,015 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 145) no Hoare annotation was computed. [2019-09-07 13:02:46,015 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2019-09-07 13:02:46,015 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 133) no Hoare annotation was computed. [2019-09-07 13:02:46,016 INFO L439 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 96 158) the Hoare annotation is: (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse1 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (<= 6 ~MPR3~0))) (.cse5 (not (= 1 ~s~0))) (.cse2 (= 0 ~pended~0)) (.cse6 (not (= ~s~0 ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 .cse1 (and .cse2 (<= ~PagingReferenceCount~0 0) (<= 0 ~PagingReferenceCount~0)) .cse3 (not (<= |old(~PagingReferenceCount~0)| 0)) .cse4 .cse5 .cse6 (not (<= 0 |old(~PagingReferenceCount~0)|)) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse5 (and .cse2 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= |old(~PagingReferenceCount~0)| 1)) (not (< 0 |old(~PagingReferenceCount~0)|)) (not (= ~customIrp~0 0))))) [2019-09-07 13:02:46,016 INFO L443 ceAbstractionStarter]: For program point L131-2(lines 131 133) no Hoare annotation was computed. [2019-09-07 13:02:46,016 INFO L443 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 96 158) no Hoare annotation was computed. [2019-09-07 13:02:46,016 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 147) no Hoare annotation was computed. [2019-09-07 13:02:46,016 INFO L443 ceAbstractionStarter]: For program point L117-2(lines 109 157) no Hoare annotation was computed. [2019-09-07 13:02:46,017 INFO L439 ceAbstractionStarter]: At program point L140(line 140) the Hoare annotation is: (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= 6 ~MPR3~0))) (.cse9 (= FlQueueIrpToThread_~status~0 0)) (.cse8 (not (= 1 ~s~0))) (.cse10 (not (= ~s~0 ~NP~0))) (.cse11 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse12 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse13 (not (= ~compRegistered~0 0))) (.cse14 (not (= 0 |old(~pended~0)|))) (.cse1 (= 0 ~pended~0)) (.cse3 (<= (+ FlQueueIrpToThread_~status~0 1073741823) 0))) (and (let ((.cse2 (<= ~PagingReferenceCount~0 1)) (.cse4 (< 0 ~PagingReferenceCount~0))) (or .cse0 (and .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 (not (<= |old(~PagingReferenceCount~0)| 0)) .cse7 .cse8 (and .cse1 .cse2 .cse9 .cse4) .cse10 (not (<= 0 |old(~PagingReferenceCount~0)|)) .cse11 .cse12 .cse13 .cse14)) (let ((.cse15 (not (= 1 ~PagingReferenceCount~0)))) (or .cse0 .cse5 .cse6 .cse7 (and .cse1 .cse9 .cse15) .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (not (<= |old(~PagingReferenceCount~0)| 1)) (not (< 0 |old(~PagingReferenceCount~0)|)) (and .cse1 .cse3 .cse15) (not (= ~customIrp~0 0)))))) [2019-09-07 13:02:46,017 INFO L443 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2019-09-07 13:02:46,017 INFO L439 ceAbstractionStarter]: At program point L138(lines 138 139) the Hoare annotation is: (let ((.cse0 (not (<= ~MPR3~0 6))) (.cse2 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse4 (not (<= 6 ~MPR3~0))) (.cse1 (= 0 ~pended~0)) (.cse5 (not (= 1 ~s~0))) (.cse6 (not (= ~s~0 ~NP~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= 0 |old(~pended~0)|)))) (and (or .cse0 (and .cse1 (<= ~PagingReferenceCount~0 1) (< 0 ~PagingReferenceCount~0)) .cse2 .cse3 (not (<= |old(~PagingReferenceCount~0)| 0)) .cse4 .cse5 .cse6 (not (<= 0 |old(~PagingReferenceCount~0)|)) .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse3 .cse4 (and .cse1 (not (= 1 ~PagingReferenceCount~0))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= |old(~PagingReferenceCount~0)| 1)) (not (< 0 |old(~PagingReferenceCount~0)|)) (not (= ~customIrp~0 0))))) [2019-09-07 13:02:46,017 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 138 139) no Hoare annotation was computed. [2019-09-07 13:02:46,017 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1010) no Hoare annotation was computed. [2019-09-07 13:02:46,018 INFO L439 ceAbstractionStarter]: At program point L989(lines 988 1011) the Hoare annotation is: (let ((.cse23 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse24 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse20 (= 0 ~pended~0)) (.cse27 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse26 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse10 (not .cse27)) (.cse9 (not .cse20)) (.cse5 (not .cse24)) (.cse6 (not .cse23)) (.cse21 (<= ~PagingReferenceCount~0 1)) (.cse29 (< 0 ~PagingReferenceCount~0)) (.cse25 (<= 1 ~compRegistered~0)) (.cse22 (<= ~MPR3~0 6)) (.cse30 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (let ((.cse14 (= ~s~0 ~MPR1~0)) (.cse15 (<= (+ .cse30 1) 0)) (.cse16 (<= 1 ~setEventCalled~0)) (.cse17 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse30) 3221225494))) (.cse18 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse19 (<= ~setEventCalled~0 1)) (.cse28 (<= ~MaximumInterfaceType~0 0)) (.cse12 (not .cse22)) (.cse13 (or .cse4 (not .cse26) .cse10 (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) .cse9) .cse5 .cse6 (not .cse21) (not .cse29) (not .cse25)))) (let ((.cse0 (or .cse12 .cse13)) (.cse1 (not .cse28)) (.cse2 (and .cse14 (<= 1 ~NP~0) .cse20 .cse21 (<= ~NP~0 1) .cse15 .cse22 .cse16 (<= 6 ~MPR3~0) .cse23 .cse24 .cse25 .cse26 .cse27 .cse17 .cse18 .cse28 .cse19 .cse29)) (.cse3 (not (= ~myStatus~0 0))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse11 (= ~SKIP1~0 ~s~0))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2) (or .cse0 .cse3 .cse1 .cse2) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse3 .cse13 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (not (= ~customIrp~0 0))) (or .cse4 (not (= 1 ~pended~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11)))))) [2019-09-07 13:02:46,018 INFO L439 ceAbstractionStarter]: At program point L981(line 981) the Hoare annotation is: (let ((.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse10 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse9 (not (= 0 ~pended~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (let ((.cse11 (not (<= ~MPR3~0 6))) (.cse12 (or .cse4 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse10 (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) .cse9) .cse5 .cse6 (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0))))) (let ((.cse0 (or .cse11 .cse12)) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (let ((.cse13 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (<= (+ .cse13 1) 0) (<= 1 ~setEventCalled~0) (= ~s~0 ~NP~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse13) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ~setEventCalled~0 1))))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2) (or .cse0 .cse2 .cse3 .cse1) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse4 (not (= 1 ~pended~0)) .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse11 .cse3 .cse2 .cse12 (not (= ~customIrp~0 0))))))) [2019-09-07 13:02:46,018 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 985) no Hoare annotation was computed. [2019-09-07 13:02:46,018 INFO L443 ceAbstractionStarter]: For program point L973-1(lines 973 985) no Hoare annotation was computed. [2019-09-07 13:02:46,019 INFO L439 ceAbstractionStarter]: At program point L994(lines 993 1010) the Hoare annotation is: (let ((.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse9 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse8 (not (= 0 ~pended~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (let ((.cse11 (not (<= ~MPR3~0 6))) (.cse13 (or .cse3 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse9 (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) .cse8) .cse4 .cse5 (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0))))) (let ((.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse10 (= ~SKIP1~0 ~s~0)) (.cse0 (or .cse11 .cse13)) (.cse2 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ~setEventCalled~0 1)))) (.cse12 (not (= ~myStatus~0 0))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse13 .cse2 (not (= ~customIrp~0 0))) (or .cse3 (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse12 .cse1))))) [2019-09-07 13:02:46,019 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 965 1037) the Hoare annotation is: (let ((.cse6 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse12 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse11 (not (= 0 ~pended~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (let ((.cse4 (not (<= ~MPR3~0 6))) (.cse5 (or .cse6 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse12 (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) .cse11) .cse7 .cse8 (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0))))) (let ((.cse1 (not (= ~myStatus~0 0))) (.cse0 (or .cse4 .cse5)) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (= 1 ~s~0)) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse13 (= ~SKIP1~0 ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse1 .cse3 .cse5 (not (= ~customIrp~0 0))) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse2 .cse3) (or .cse6 (not (= 1 ~pended~0)) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13))))) [2019-09-07 13:02:46,019 INFO L443 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 965 1037) no Hoare annotation was computed. [2019-09-07 13:02:46,019 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1033) no Hoare annotation was computed. [2019-09-07 13:02:46,019 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 965 1037) no Hoare annotation was computed. [2019-09-07 13:02:46,019 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 983) no Hoare annotation was computed. [2019-09-07 13:02:46,020 INFO L439 ceAbstractionStarter]: At program point L1008(lines 972 1036) the Hoare annotation is: (let ((.cse32 (div IofCallDriver_~__cil_tmp7~0 4294967296)) (.cse28 (<= (+ ~SKIP2~0 3) ~IPC~0)) (.cse29 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse27 (= 0 ~pended~0)) (.cse31 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse30 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse5 (not .cse30)) (.cse11 (not .cse31)) (.cse10 (not .cse27)) (.cse6 (not .cse29)) (.cse7 (not .cse28)) (.cse18 (<= ~PagingReferenceCount~0 1)) (.cse20 (< 0 ~PagingReferenceCount~0)) (.cse19 (<= ~MPR3~0 6)) (.cse21 (= ~s~0 ~MPR1~0)) (.cse26 (<= 1 ~compRegistered~0)) (.cse25 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse23 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse32) 3221225494))) (.cse24 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (.cse22 (<= (+ .cse32 1) 0))) (let ((.cse16 (or (and .cse21 .cse27 .cse28 .cse29 .cse26 .cse25 .cse30 .cse31 .cse23 (= 0 IofCallDriver_~returnVal2~0) .cse24 .cse22) (and .cse21 .cse27 .cse28 .cse29 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse26 .cse25 .cse30 .cse23 .cse31 .cse24 .cse22))) (.cse15 (<= 1 ~setEventCalled~0)) (.cse17 (<= ~setEventCalled~0 1)) (.cse13 (not .cse19)) (.cse14 (or .cse5 (not .cse25) .cse11 (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) .cse10) .cse6 .cse7 (not .cse18) (not .cse20) (not .cse26)))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse12 (= ~SKIP1~0 ~s~0)) (.cse0 (or .cse13 .cse14)) (.cse4 (and .cse21 .cse22 .cse15 (= 259 IofCallDriver_~returnVal2~0) .cse23 .cse24 .cse17)) (.cse3 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (and (<= 1 ~NP~0) .cse18 .cse19 .cse15 .cse16 .cse17 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse2 .cse4 .cse14 (and .cse15 .cse16 .cse17) (not (= ~customIrp~0 0))) (or .cse5 (not (= 1 ~pended~0)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse4 .cse3 .cse1)))))) [2019-09-07 13:02:46,020 INFO L439 ceAbstractionStarter]: At program point L975(line 975) the Hoare annotation is: (let ((.cse6 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse12 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse11 (not (= 0 ~pended~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (let ((.cse4 (not (<= ~MPR3~0 6))) (.cse5 (or .cse6 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse12 (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) .cse11) .cse7 .cse8 (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0))))) (let ((.cse1 (not (= ~myStatus~0 0))) (.cse0 (or .cse4 .cse5)) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (= 1 ~s~0)) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse1 .cse3 .cse5 (not (= ~customIrp~0 0))) (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse2 .cse3) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse6 (not (= 1 ~pended~0)) .cse7 .cse8 .cse9 .cse10 .cse12))))) [2019-09-07 13:02:46,020 INFO L443 ceAbstractionStarter]: For program point L975-1(line 975) no Hoare annotation was computed. [2019-09-07 13:02:46,021 INFO L439 ceAbstractionStarter]: At program point L996(lines 995 1010) the Hoare annotation is: (let ((.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse9 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse8 (not (= 0 ~pended~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (let ((.cse11 (not (<= ~MPR3~0 6))) (.cse13 (or .cse3 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse9 (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) .cse8) .cse4 .cse5 (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0))))) (let ((.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse10 (= ~SKIP1~0 ~s~0)) (.cse0 (or .cse11 .cse13)) (.cse2 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= ~setEventCalled~0 1)))) (.cse12 (not (= ~myStatus~0 0))) (.cse1 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse13 .cse2 (not (= ~customIrp~0 0))) (or .cse3 (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (or .cse0 .cse2 .cse12 .cse1))))) [2019-09-07 13:02:46,021 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1032) no Hoare annotation was computed. [2019-09-07 13:02:46,021 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1011) no Hoare annotation was computed. [2019-09-07 13:02:46,021 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1023) no Hoare annotation was computed. [2019-09-07 13:02:46,021 INFO L439 ceAbstractionStarter]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse9 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse8 (not (= 0 ~pended~0))) (.cse4 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse5 (not (<= (+ ~SKIP2~0 3) ~IPC~0)))) (let ((.cse10 (not (<= ~MPR3~0 6))) (.cse11 (or .cse3 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse9 (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) .cse8) .cse4 .cse5 (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0))))) (let ((.cse0 (or .cse10 .cse11)) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (not (= ~myStatus~0 0))) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1) (or .cse0 .cse2 .cse1) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse2 .cse11 (not (= ~customIrp~0 0))) (or .cse3 (not (= 1 ~pended~0)) .cse4 .cse5 .cse6 .cse7 .cse9))))) [2019-09-07 13:02:46,021 INFO L443 ceAbstractionStarter]: For program point L1030-1(lines 1012 1034) no Hoare annotation was computed. [2019-09-07 13:02:46,022 INFO L439 ceAbstractionStarter]: At program point L1307(line 1307) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,022 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1286) no Hoare annotation was computed. [2019-09-07 13:02:46,022 INFO L443 ceAbstractionStarter]: For program point L1307-1(line 1307) no Hoare annotation was computed. [2019-09-07 13:02:46,022 INFO L443 ceAbstractionStarter]: For program point L1274-2(lines 1273 1562) no Hoare annotation was computed. [2019-09-07 13:02:46,022 INFO L439 ceAbstractionStarter]: At program point L1514(line 1514) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,022 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 1510 1516) no Hoare annotation was computed. [2019-09-07 13:02:46,022 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1531) no Hoare annotation was computed. [2019-09-07 13:02:46,023 INFO L439 ceAbstractionStarter]: At program point L1316(lines 1315 1549) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,023 INFO L439 ceAbstractionStarter]: At program point L1399(lines 1389 1529) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (not (= 1 ~PagingReferenceCount~0))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,023 INFO L443 ceAbstractionStarter]: For program point L1424(lines 1424 1427) no Hoare annotation was computed. [2019-09-07 13:02:46,023 INFO L439 ceAbstractionStarter]: At program point L1292(line 1292) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,023 INFO L443 ceAbstractionStarter]: For program point L1292-1(line 1292) no Hoare annotation was computed. [2019-09-07 13:02:46,023 INFO L439 ceAbstractionStarter]: At program point L1449(line 1449) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= 0 ~pended~0) (<= ~PagingReferenceCount~0 0) (= 1 ~s~0) (<= 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,024 INFO L443 ceAbstractionStarter]: For program point L1449-1(line 1449) no Hoare annotation was computed. [2019-09-07 13:02:46,024 INFO L439 ceAbstractionStarter]: At program point L1383(lines 1375 1533) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,024 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1533) no Hoare annotation was computed. [2019-09-07 13:02:46,024 INFO L443 ceAbstractionStarter]: For program point L1433(lines 1433 1437) no Hoare annotation was computed. [2019-09-07 13:02:46,024 INFO L439 ceAbstractionStarter]: At program point L1301(line 1301) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,024 INFO L439 ceAbstractionStarter]: At program point L1557(line 1557) the Hoare annotation is: (let ((.cse1 (= ~s~0 ~NP~0)) (.cse2 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse0 (and (<= (+ ~NP~0 5) ~MPR3~0) (= 0 ~pended~0) .cse1 .cse2))) (or (not (<= ~MPR3~0 6)) (and .cse0 (<= (+ FloppyDeviceControl_~ntStatus~3 1073741811) 0)) (and (= 1 ~pended~0) .cse1) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not .cse2) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (and .cse0 (not (= FloppyDeviceControl_~ntStatus~3 259)) (= FloppyDeviceControl_~ntStatus~3 FloppyDeviceControl_~__cil_tmp91~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))))) [2019-09-07 13:02:46,025 INFO L443 ceAbstractionStarter]: For program point L1301-1(lines 1297 1303) no Hoare annotation was computed. [2019-09-07 13:02:46,025 INFO L443 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 1182 1563) no Hoare annotation was computed. [2019-09-07 13:02:46,025 INFO L439 ceAbstractionStarter]: At program point L1483(lines 1347 1541) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= 0 ~pended~0) (<= ~PagingReferenceCount~0 0) (= 1 ~s~0) (<= 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,025 INFO L443 ceAbstractionStarter]: For program point L1475(lines 1475 1478) no Hoare annotation was computed. [2019-09-07 13:02:46,025 INFO L443 ceAbstractionStarter]: For program point L1467(lines 1467 1480) no Hoare annotation was computed. [2019-09-07 13:02:46,025 INFO L443 ceAbstractionStarter]: For program point L1368(lines 1368 1535) no Hoare annotation was computed. [2019-09-07 13:02:46,025 INFO L439 ceAbstractionStarter]: At program point L1525(lines 1400 1526) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (or (and (not (= FloppyDeviceControl_~ntStatus~3 259)) (= 0 ~pended~0) .cse0) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= ~compRegistered~0 0)) (not (<= ~MPR3~0 6)) (and (= 1 ~pended~0) .cse0) (not (<= 1 ~NP~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (<= ~NP~0 1)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= 0 |old(~pended~0)|)))) [2019-09-07 13:02:46,026 INFO L443 ceAbstractionStarter]: For program point L1451(lines 1451 1454) no Hoare annotation was computed. [2019-09-07 13:02:46,026 INFO L443 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 1182 1563) no Hoare annotation was computed. [2019-09-07 13:02:46,026 INFO L443 ceAbstractionStarter]: For program point L1410(lines 1410 1414) no Hoare annotation was computed. [2019-09-07 13:02:46,026 INFO L439 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 1182 1563) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= 0 ~pended~0) (<= ~PagingReferenceCount~0 0) (= 1 ~s~0) (<= 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,026 INFO L443 ceAbstractionStarter]: For program point L1361(lines 1361 1537) no Hoare annotation was computed. [2019-09-07 13:02:46,026 INFO L443 ceAbstractionStarter]: For program point L1320(lines 1320 1547) no Hoare annotation was computed. [2019-09-07 13:02:46,026 INFO L443 ceAbstractionStarter]: For program point L1279(lines 1279 1284) no Hoare annotation was computed. [2019-09-07 13:02:46,027 INFO L443 ceAbstractionStarter]: For program point L1502(lines 1502 1504) no Hoare annotation was computed. [2019-09-07 13:02:46,027 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1497) no Hoare annotation was computed. [2019-09-07 13:02:46,027 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1481) no Hoare annotation was computed. [2019-09-07 13:02:46,027 INFO L443 ceAbstractionStarter]: For program point L1329(lines 1329 1545) no Hoare annotation was computed. [2019-09-07 13:02:46,027 INFO L443 ceAbstractionStarter]: For program point L1296(lines 1296 1310) no Hoare annotation was computed. [2019-09-07 13:02:46,027 INFO L439 ceAbstractionStarter]: At program point L1321(lines 1320 1547) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,027 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1543) no Hoare annotation was computed. [2019-09-07 13:02:46,027 INFO L443 ceAbstractionStarter]: For program point L1462(lines 1462 1465) no Hoare annotation was computed. [2019-09-07 13:02:46,027 INFO L443 ceAbstractionStarter]: For program point L1396(lines 1396 1527) no Hoare annotation was computed. [2019-09-07 13:02:46,028 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1303) no Hoare annotation was computed. [2019-09-07 13:02:46,028 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1559) no Hoare annotation was computed. [2019-09-07 13:02:46,028 INFO L439 ceAbstractionStarter]: At program point L1520(lines 1520 1521) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (and (= 0 ~pended~0) (not (= 1 ~PagingReferenceCount~0)) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,028 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 1553 1559) no Hoare annotation was computed. [2019-09-07 13:02:46,028 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 1520 1521) no Hoare annotation was computed. [2019-09-07 13:02:46,028 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1541) no Hoare annotation was computed. [2019-09-07 13:02:46,028 INFO L439 ceAbstractionStarter]: At program point L1281(line 1281) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (not (= 1 ~PagingReferenceCount~0))) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,028 INFO L443 ceAbstractionStarter]: For program point L1281-1(line 1281) no Hoare annotation was computed. [2019-09-07 13:02:46,029 INFO L443 ceAbstractionStarter]: For program point L1471(lines 1471 1479) no Hoare annotation was computed. [2019-09-07 13:02:46,029 INFO L439 ceAbstractionStarter]: At program point L1339(lines 1329 1545) the Hoare annotation is: (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and (= 0 ~pended~0) (<= ~PagingReferenceCount~0 0) (= 1 ~s~0) (<= 0 ~PagingReferenceCount~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= |old(~PagingReferenceCount~0)| 0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= 0 |old(~PagingReferenceCount~0)|)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,029 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-09-07 13:02:46,029 INFO L443 ceAbstractionStarter]: For program point L1389(lines 1389 1529) no Hoare annotation was computed. [2019-09-07 13:02:46,029 INFO L443 ceAbstractionStarter]: For program point L1356(lines 1356 1539) no Hoare annotation was computed. [2019-09-07 13:02:46,029 INFO L443 ceAbstractionStarter]: For program point L1315(lines 1315 1549) no Hoare annotation was computed. [2019-09-07 13:02:46,029 INFO L443 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 1564 1580) no Hoare annotation was computed. [2019-09-07 13:02:46,029 INFO L443 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 1564 1580) no Hoare annotation was computed. [2019-09-07 13:02:46,030 INFO L446 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 1564 1580) the Hoare annotation is: true [2019-09-07 13:02:46,030 INFO L443 ceAbstractionStarter]: For program point L1573(lines 1573 1577) no Hoare annotation was computed. [2019-09-07 13:02:46,030 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1578) no Hoare annotation was computed. [2019-09-07 13:02:46,030 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:02:46,030 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) [2019-09-07 13:02:46,030 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:02:46,030 INFO L439 ceAbstractionStarter]: At program point L1598(line 1598) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (= |old(~PagingReferenceCount~0)| 1) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|))) [2019-09-07 13:02:46,030 INFO L443 ceAbstractionStarter]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2019-09-07 13:02:46,030 INFO L443 ceAbstractionStarter]: For program point L1590(lines 1590 1592) no Hoare annotation was computed. [2019-09-07 13:02:46,031 INFO L443 ceAbstractionStarter]: For program point L1590-2(lines 1588 1619) no Hoare annotation was computed. [2019-09-07 13:02:46,031 INFO L439 ceAbstractionStarter]: At program point L1613(line 1613) the Hoare annotation is: (or (= |old(~PagingReferenceCount~0)| 1) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 13:02:46,031 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 1609 1615) no Hoare annotation was computed. [2019-09-07 13:02:46,031 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1615) no Hoare annotation was computed. [2019-09-07 13:02:46,031 INFO L443 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 1581 1620) no Hoare annotation was computed. [2019-09-07 13:02:46,031 INFO L439 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 1581 1620) the Hoare annotation is: (or (= |old(~PagingReferenceCount~0)| 1) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (not (= 1 ~PagingReferenceCount~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0))) [2019-09-07 13:02:46,031 INFO L443 ceAbstractionStarter]: For program point L1601(lines 1601 1603) no Hoare annotation was computed. [2019-09-07 13:02:46,031 INFO L443 ceAbstractionStarter]: For program point L1601-2(lines 1601 1603) no Hoare annotation was computed. [2019-09-07 13:02:46,032 INFO L443 ceAbstractionStarter]: For program point L1593-1(lines 1593 1617) no Hoare annotation was computed. [2019-09-07 13:02:46,032 INFO L443 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 1581 1620) no Hoare annotation was computed. [2019-09-07 13:02:46,032 INFO L439 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: (let ((.cse3 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (= |old(~customIrp~0)| 0)))) (.cse4 (not (<= ~MaximumInterfaceType~0 0))) (.cse0 (= FlFdcDeviceIo_~__cil_tmp11~0 259)) (.cse5 (<= ~MPR3~0 ~s~0)) (.cse6 (<= ~s~0 ~MPR3~0)) (.cse1 (<= 1 ~setEventCalled~0)) (.cse2 (<= ~setEventCalled~0 1))) (and (or (and .cse0 (= 1 ~s~0) .cse1 .cse2) .cse3 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse4 (and .cse0 (and .cse5 .cse6 .cse1 .cse2))) (or .cse3 (not (= ~myStatus~0 0)) .cse4 (and .cse0 .cse5 .cse6 .cse1 .cse2)))) [2019-09-07 13:02:46,032 INFO L443 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2019-09-07 13:02:46,032 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 641) no Hoare annotation was computed. [2019-09-07 13:02:46,032 INFO L439 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 611 645) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2))) [2019-09-07 13:02:46,033 INFO L443 ceAbstractionStarter]: For program point L636-2(lines 636 641) no Hoare annotation was computed. [2019-09-07 13:02:46,033 INFO L439 ceAbstractionStarter]: At program point L632(line 632) the Hoare annotation is: (let ((.cse1 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (= |old(~customIrp~0)| 0)))) (.cse0 (= 1 ~s~0)) (.cse2 (not (<= ~MaximumInterfaceType~0 0)))) (and (or .cse0 .cse1 (not (= ~myStatus~0 0)) .cse2) (or .cse1 .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse2))) [2019-09-07 13:02:46,033 INFO L443 ceAbstractionStarter]: For program point L632-1(line 632) no Hoare annotation was computed. [2019-09-07 13:02:46,033 INFO L443 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 611 645) no Hoare annotation was computed. [2019-09-07 13:02:46,033 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2019-09-07 13:02:46,033 INFO L439 ceAbstractionStarter]: At program point L623(lines 623 624) the Hoare annotation is: (let ((.cse0 (or (not (<= ~MPR3~0 6)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 1 |old(~s~0)|)) (or (not (= |old(~s~0)| ~NP~0)) (not (= 0 ~pended~0))) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~SKIP2~0 3) ~IPC~0)) (not (<= ~PagingReferenceCount~0 1)) (not (< 0 ~PagingReferenceCount~0)) (not (<= 1 ~compRegistered~0)) (not (= |old(~customIrp~0)| 0)))) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)))) (and (or .cse0 (not (<= (+ ~myStatus~0 1073741637) 0)) .cse1 .cse2) (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2))) [2019-09-07 13:02:46,034 INFO L443 ceAbstractionStarter]: For program point L623-1(lines 623 624) no Hoare annotation was computed. [2019-09-07 13:02:46,034 INFO L443 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 611 645) no Hoare annotation was computed. [2019-09-07 13:02:46,034 INFO L443 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 89 95) no Hoare annotation was computed. [2019-09-07 13:02:46,034 INFO L446 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 89 95) the Hoare annotation is: true [2019-09-07 13:02:46,034 INFO L443 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 89 95) no Hoare annotation was computed. [2019-09-07 13:02:46,034 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-07 13:02:46,034 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~MPR1~0) (= ~s~0 ~IPC~0) (= ~myStatus~0 0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~DC~0) (= 0 ~customIrp~0) (<= ~PagingReferenceCount~0 0) (<= ~MPR3~0 ~s~0) (= ~s~0 ~SKIP2~0) (<= ~s~0 ~MPR3~0) (<= 0 ~PagingReferenceCount~0) (<= ~MaximumInterfaceType~0 0) (= ~SKIP1~0 ~s~0)) [2019-09-07 13:02:46,034 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-07 13:02:46,034 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-07 13:02:46,035 INFO L446 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 864 884) the Hoare annotation is: true [2019-09-07 13:02:46,035 INFO L443 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 864 884) no Hoare annotation was computed. [2019-09-07 13:02:46,035 INFO L446 ceAbstractionStarter]: At program point L873(lines 872 882) the Hoare annotation is: true [2019-09-07 13:02:46,035 INFO L443 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkFINAL(lines 864 884) no Hoare annotation was computed. [2019-09-07 13:02:46,035 INFO L446 ceAbstractionStarter]: At program point L871(lines 870 882) the Hoare annotation is: true [2019-09-07 13:02:46,035 INFO L443 ceAbstractionStarter]: For program point L870(lines 870 882) no Hoare annotation was computed. [2019-09-07 13:02:46,035 INFO L446 ceAbstractionStarter]: At program point L896(lines 895 905) the Hoare annotation is: true [2019-09-07 13:02:46,035 INFO L446 ceAbstractionStarter]: At program point L894(lines 893 905) the Hoare annotation is: true [2019-09-07 13:02:46,035 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 905) no Hoare annotation was computed. [2019-09-07 13:02:46,036 INFO L443 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 885 907) no Hoare annotation was computed. [2019-09-07 13:02:46,036 INFO L446 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 885 907) the Hoare annotation is: true [2019-09-07 13:02:46,036 INFO L443 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionFINAL(lines 885 907) no Hoare annotation was computed. [2019-09-07 13:02:46,036 INFO L446 ceAbstractionStarter]: At program point L1153(lines 1152 1164) the Hoare annotation is: true [2019-09-07 13:02:46,036 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1164) no Hoare annotation was computed. [2019-09-07 13:02:46,036 INFO L446 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1146 1166) the Hoare annotation is: true [2019-09-07 13:02:46,036 INFO L443 ceAbstractionStarter]: For program point ZwCloseFINAL(lines 1146 1166) no Hoare annotation was computed. [2019-09-07 13:02:46,036 INFO L446 ceAbstractionStarter]: At program point L1155(lines 1154 1164) the Hoare annotation is: true [2019-09-07 13:02:46,036 INFO L443 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1146 1166) no Hoare annotation was computed. [2019-09-07 13:02:46,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 01:02:46 BoogieIcfgContainer [2019-09-07 13:02:46,108 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 13:02:46,110 INFO L168 Benchmark]: Toolchain (without parser) took 72362.13 ms. Allocated memory was 132.1 MB in the beginning and 1.0 GB in the end (delta: 889.2 MB). Free memory was 86.7 MB in the beginning and 510.0 MB in the end (delta: -423.3 MB). Peak memory consumption was 909.2 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:46,110 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 13:02:46,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.08 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 86.5 MB in the beginning and 160.6 MB in the end (delta: -74.1 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:46,111 INFO L168 Benchmark]: Boogie Preprocessor took 122.71 ms. Allocated memory is still 199.2 MB. Free memory was 160.6 MB in the beginning and 156.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:46,112 INFO L168 Benchmark]: RCFGBuilder took 1534.78 ms. Allocated memory was 199.2 MB in the beginning and 222.3 MB in the end (delta: 23.1 MB). Free memory was 156.2 MB in the beginning and 158.2 MB in the end (delta: -2.0 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:46,117 INFO L168 Benchmark]: TraceAbstraction took 69928.65 ms. Allocated memory was 222.3 MB in the beginning and 1.0 GB in the end (delta: 799.0 MB). Free memory was 158.2 MB in the beginning and 510.0 MB in the end (delta: -351.8 MB). Peak memory consumption was 890.5 MB. Max. memory is 7.1 GB. [2019-09-07 13:02:46,123 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.08 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 86.5 MB in the beginning and 160.6 MB in the end (delta: -74.1 MB). Peak memory consumption was 30.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 122.71 ms. Allocated memory is still 199.2 MB. Free memory was 160.6 MB in the beginning and 156.2 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1534.78 ms. Allocated memory was 199.2 MB in the beginning and 222.3 MB in the end (delta: 23.1 MB). Free memory was 156.2 MB in the beginning and 158.2 MB in the end (delta: -2.0 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69928.65 ms. Allocated memory was 222.3 MB in the beginning and 1.0 GB in the end (delta: 799.0 MB). Free memory was 158.2 MB in the beginning and 510.0 MB in the end (delta: -351.8 MB). Peak memory consumption was 890.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1626]: 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: 744]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((0 == pended && 0 == compRegistered) && 1 == s) && 0 <= PagingReferenceCount) && MPR3 <= 6) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && 6 <= MPR3) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && PagingReferenceCount <= 0) && NP + 4 <= MPR1) && status == 0) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || (((((((((((((((0 == pended && 0 == compRegistered) && 1 == s) && 0 <= PagingReferenceCount) && MPR3 <= 6) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && 6 <= MPR3) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && PagingReferenceCount <= 0) && NP + 4 <= MPR1) && status == 0) && DC + 2 <= SKIP2) && MaximumInterfaceType <= 0)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 1320]: Loop Invariant Derived loop invariant: (((((((((((!(MPR3 <= 6) || (0 == pended && s == NP)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 1111]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) == 0) || !(MaximumInterfaceType <= 0)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) || ((0 <= InterfaceType && (((((((((((((0 == pended && SKIP2 + 3 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(ntStatus == 259)) && myStatus == \old(myStatus)) && MaximumInterfaceType <= 0)) && (((!(\old(myStatus) + 1073741637 <= 0) || !(MaximumInterfaceType <= 0)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) || ((0 <= InterfaceType && (((((((((((((0 == pended && SKIP2 + 3 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(ntStatus == 259)) && myStatus == \old(myStatus)) && MaximumInterfaceType <= 0)) - InvariantResult [Line: 729]: Loop Invariant Derived loop invariant: (((((((((((((((((status == 0 && 0 == pended) && s == NP) && 0 == compRegistered) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 938]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1154]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 1 == s) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) || !(\old(myStatus) == 0)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) && ((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 1 == s) && \old(customIrp) == customIrp) && 0 < PagingReferenceCount) || !(\old(myStatus) + 1073741637 <= 0)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) - InvariantResult [Line: 917]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 797]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && PagingReferenceCount <= 1) && NP + 4 <= MPR1) && 0 < PagingReferenceCount) || ((((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 0 <= PagingReferenceCount) && PagingReferenceCount <= 0) && NP + 4 <= MPR1)) && 1 <= NP) && MPR3 <= 6) && !(status == 259)) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && status + 1073741536 <= 0)) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || (status == 0 && s == DC)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) && !(status == 259))) || !(\old(PagingReferenceCount) <= 0)) || ((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || (((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || (status == 0 && (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: (((((((!(MPR3 <= 6) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(myStatus + 1073741637 <= 0)) || !(MaximumInterfaceType <= 0)) || (((((s == MPR1 && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && (((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || SKIP1 == s)) && ((((!(MPR3 <= 6) || !(myStatus == 0)) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || (((((s == MPR1 && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || !(customIrp == 0))) && (((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || SKIP1 == s)) && ((((!(MPR3 <= 6) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || (((((s == MPR1 && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || !(myStatus == 0)) || !(MaximumInterfaceType <= 0)) - InvariantResult [Line: 851]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 893]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: (((((((((1 == s && \old(customIrp) == customIrp) || !(myStatus == 0)) || !(MaximumInterfaceType <= 0)) || ((((((((((!(MPR3 <= 6) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(\old(s) <= MPR3)) || !(NP + 4 <= MPR1)) || !(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC) || (!(0 == pended) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(NP <= 1)) || !(MPR3 <= \old(s))) || !(\old(setEventCalled) <= 1)) && ((((((((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(1 <= \old(setEventCalled))) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(\old(setEventCalled) <= 1)) || !(myStatus + 1073741637 <= 0)) || ((\old(customIrp) == 1 && ((((((((((((((0 == pended && SKIP2 + 3 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((((0 == pended && SKIP2 + 3 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(MaximumInterfaceType <= 0))) && ((((((((((((((!(MPR3 <= 6) || !(1 <= NP)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC) || (!(0 == pended) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(NP <= 1)) || (1 == s && \old(customIrp) == customIrp)) || !(1 <= \old(setEventCalled))) || !(\old(s) <= MPR3)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) || !(MPR3 <= \old(s))) || !(\old(setEventCalled) <= 1))) && ((((((((((((((((!(MPR3 <= 6) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || ((((((((((((((((0 == pended && SKIP2 + 3 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(1 <= \old(setEventCalled))) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(\old(customIrp) == 0)) || !(\old(setEventCalled) <= 1))) && (((((((!(NP + 5 <= MPR3) || !(1 == pended)) || s == NP) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(DC + 2 <= SKIP2))) && (((((((((((!(MPR3 <= 6) || (1 == s && \old(customIrp) == customIrp)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == pended)) || !(\old(customIrp) == 0))) && ((((1 == s && \old(customIrp) == customIrp) || !(myStatus + 1073741637 <= 0)) || !(MaximumInterfaceType <= 0)) || ((((((((((!(MPR3 <= 6) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(\old(s) <= MPR3)) || !(NP + 4 <= MPR1)) || !(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC) || (!(0 == pended) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(NP <= 1)) || !(MPR3 <= \old(s))) || !(\old(setEventCalled) <= 1)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) + 1073741637 <= 0) || !(MaximumInterfaceType <= 0)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) || ((((((((((((((0 == pended && SKIP2 + 3 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(ntStatus == 259)) && myStatus == \old(myStatus))) && (((!(\old(myStatus) == 0) || !(MaximumInterfaceType <= 0)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) || ((((((((((((((0 == pended && SKIP2 + 3 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 <= 6) && 0 < PagingReferenceCount) && 6 <= MPR3) && !(ntStatus == 259)) && myStatus == \old(myStatus))) - InvariantResult [Line: 1347]: Loop Invariant Derived loop invariant: (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || (((0 == pended && PagingReferenceCount <= 0) && 1 == s) && 0 <= PagingReferenceCount)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 1131]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1389]: Loop Invariant Derived loop invariant: (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || ((0 == pended && s == \old(s)) && !(1 == PagingReferenceCount))) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && s == NP) && 0 == ntStatus) && 0 < PagingReferenceCount) || !(\old(myStatus) + 1073741637 <= 0)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) && (((!(\old(myStatus) == 0) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) || (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) && s == NP) && 0 == ntStatus) && 0 < PagingReferenceCount)) - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 == pended && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && PagingReferenceCount <= 0) && NP + 4 <= MPR1) && s <= NP) && status == 0) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && 0 <= PagingReferenceCount) && MPR3 <= 6) && 6 <= MPR3) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(MPR3 <= 6) || !(1 <= NP)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC) || (!(0 == pended) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(NP <= 1)) || !(1 <= \old(setEventCalled))) || !(\old(s) <= MPR3)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) || !(MPR3 <= \old(s))) || !(\old(setEventCalled) <= 1)) && ((!(myStatus == 0) || !(MaximumInterfaceType <= 0)) || ((((((((((!(MPR3 <= 6) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(\old(s) <= MPR3)) || !(NP + 4 <= MPR1)) || !(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC) || (!(0 == pended) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(NP <= 1)) || !(MPR3 <= \old(s))) || !(\old(setEventCalled) <= 1))) && ((!(myStatus + 1073741637 <= 0) || !(MaximumInterfaceType <= 0)) || ((((((((((!(MPR3 <= 6) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(\old(s) <= MPR3)) || !(NP + 4 <= MPR1)) || !(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC) || (!(0 == pended) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(NP <= 1)) || !(MPR3 <= \old(s))) || !(\old(setEventCalled) <= 1))) && (((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || s == \old(s)) || !(compRegistered == 0)) || !(DC + 2 <= SKIP2))) && ((((((((((((((((!(MPR3 <= 6) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && s == NP) && setEventCalled <= 1)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(1 <= \old(setEventCalled))) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(\old(customIrp) == 0)) || !(\old(setEventCalled) <= 1))) && (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || (1 == s && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == pended)) || !(\old(customIrp) == 0))) && ((((((((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(1 <= \old(setEventCalled))) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(\old(setEventCalled) <= 1)) || !(myStatus + 1073741637 <= 0)) || !(MaximumInterfaceType <= 0)) || (((\old(customIrp) == customIrp && 1 <= setEventCalled) && s == NP) && setEventCalled <= 1)) - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) + 1073741637 <= 0) || ((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 1 == s) && 0 < PagingReferenceCount)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) && (((((((0 == pended && 0 == compRegistered) && PagingReferenceCount <= 1) && 1 == s) && 0 < PagingReferenceCount) || !(\old(myStatus) == 0)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) - InvariantResult [Line: 872]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 988]: Loop Invariant Derived loop invariant: (((((((!(MPR3 <= 6) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(myStatus + 1073741637 <= 0)) || !(MaximumInterfaceType <= 0)) || ((((((((((((((((((s == MPR1 && 1 <= NP) && 0 == pended) && PagingReferenceCount <= 1) && NP <= 1) && __cil_tmp7 / 4294967296 + 1 <= 0) && MPR3 <= 6) && 1 <= setEventCalled) && 6 <= MPR3) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 0 < PagingReferenceCount)) && ((((!(MPR3 <= 6) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(myStatus == 0)) || !(MaximumInterfaceType <= 0)) || ((((((((((((((((((s == MPR1 && 1 <= NP) && 0 == pended) && PagingReferenceCount <= 1) && NP <= 1) && __cil_tmp7 / 4294967296 + 1 <= 0) && MPR3 <= 6) && 1 <= setEventCalled) && 6 <= MPR3) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && MaximumInterfaceType <= 0) && setEventCalled <= 1) && 0 < PagingReferenceCount))) && (((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || SKIP1 == s)) && ((((!(MPR3 <= 6) || !(myStatus == 0)) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || (((((s == MPR1 && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || !(customIrp == 0))) && (((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || SKIP1 == s) - InvariantResult [Line: 746]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || !(\old(s) == \old(NP))) || 0 <= status) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 221]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) + 1073741637 <= 0) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) || ((((((((0 == pended && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && s == \old(s)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) && (((!(\old(myStatus) == 0) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) || ((((((((0 == pended && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && s == \old(s)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) - InvariantResult [Line: 1109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((!(MPR3 <= 6) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || ((((((1 <= NP && PagingReferenceCount <= 1) && MPR3 <= 6) && 1 <= setEventCalled) && ((((((((((((s == MPR1 && 0 == pended) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) || (((((((((((s == MPR1 && 0 == pended) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0))) && setEventCalled <= 1) && 0 < PagingReferenceCount)) || !(myStatus == 0)) || !(MaximumInterfaceType <= 0)) || ((((((s == MPR1 && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && 259 == returnVal2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && (((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || SKIP1 == s)) && (((((!(MPR3 <= 6) || !(myStatus == 0)) || ((((((s == MPR1 && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && 259 == returnVal2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || ((1 <= setEventCalled && ((((((((((((s == MPR1 && 0 == pended) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) || (((((((((((s == MPR1 && 0 == pended) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0))) && setEventCalled <= 1)) || !(customIrp == 0))) && (((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || SKIP1 == s)) && (((((!(MPR3 <= 6) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(myStatus + 1073741637 <= 0)) || ((((((s == MPR1 && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && 259 == returnVal2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || !(MaximumInterfaceType <= 0)) || ((((((1 <= NP && PagingReferenceCount <= 1) && MPR3 <= 6) && 1 <= setEventCalled) && ((((((((((((s == MPR1 && 0 == pended) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) || (((((((((((s == MPR1 && 0 == pended) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && returnVal2 + 1073741823 <= 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && DC + 2 <= SKIP2) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0))) && setEventCalled <= 1) && 0 < PagingReferenceCount)) - InvariantResult [Line: 1152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 787]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(\old(MaximumInterfaceType) <= 0) || !(\old(SKIP1) == \old(s))) || (status == 0 && s == DC)) || (((s == SKIP2 && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && ((1 == pended && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(PagingReferenceCount) <= 0)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) || ((((((status == lowerDriverReturn && s == IPC) && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s))) || !(\old(myStatus) == 0)) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || (status == lowerDriverReturn && ((((s == SKIP2 && NP + 5 <= MPR3) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || ((((((status == lowerDriverReturn && s == IPC) && status == 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) && !(status == 259))) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3)) - InvariantResult [Line: 915]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1315]: Loop Invariant Derived loop invariant: (((((((((((!(MPR3 <= 6) || (0 == pended && s == NP)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(\old(MaximumInterfaceType) <= 0) || (((((((status == lowerDriverReturn && s == IPC) && status == 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(SKIP1) == \old(s))) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s == DC)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || ((status == 0 && 0 == pended) && s == DC)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s))) || !(\old(myStatus) == 0)) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || (status == lowerDriverReturn && (((((s == IPC && NP + 5 <= MPR3) && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && s == SKIP2) && NP + 5 <= MPR3) && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s == DC) && !(status == 259))) || ((((((1 == pended && s == SKIP2) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) - InvariantResult [Line: 936]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 734]: Loop Invariant Derived loop invariant: (((((((((((((((((status == 0 && 0 == pended) && s == NP) && 0 == compRegistered) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(PagingReferenceCount) <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s)) - InvariantResult [Line: 895]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 779]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((1 == pended && s == SKIP2) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) || !(\old(MaximumInterfaceType) <= 0)) || (((((((status == lowerDriverReturn && s == IPC) && status == 0) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(SKIP1) == \old(s))) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s == DC)) || !(\old(PagingReferenceCount) <= 0)) || ((status == 0 && 0 == pended) && s == DC)) || !(0 == \old(pended))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || !(\old(MPR3) <= \old(s))) || !(\old(myStatus) == 0)) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((s == IPC && 1 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2)) || !(0 <= \old(PagingReferenceCount))) || !(\old(compRegistered) == 0)) || (status == lowerDriverReturn && (((((s == IPC && NP + 5 <= MPR3) && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (((((((status == lowerDriverReturn && s == SKIP2) && NP + 5 <= MPR3) && 0 == pended) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || !(\old(s) <= \old(MPR3))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s == DC) && !(status == 259)) - InvariantResult [Line: 1400]: Loop Invariant Derived loop invariant: (((((((((((((((!(ntStatus == 259) && 0 == pended) && s == NP) || !(NP + 4 <= MPR1)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(compRegistered == 0)) || !(MPR3 <= 6)) || (1 == pended && s == NP)) || !(1 <= NP)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(NP <= 1)) || !(\old(s) == NP)) || !(SKIP2 + 3 <= IPC)) || !(0 == \old(pended)) - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: (((((((!(MPR3 <= 6) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(myStatus + 1073741637 <= 0)) || !(MaximumInterfaceType <= 0)) || (((((s == MPR1 && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) && (((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || SKIP1 == s)) && ((((!(MPR3 <= 6) || !(myStatus == 0)) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || (((((s == MPR1 && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || !(customIrp == 0))) && (((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || SKIP1 == s)) && ((((!(MPR3 <= 6) || ((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP) || !(0 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || (((((s == MPR1 && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && setEventCalled <= 1)) || !(myStatus == 0)) || !(MaximumInterfaceType <= 0)) - InvariantResult [Line: 849]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1089]: Loop Invariant Derived loop invariant: (((((((((1 == s && \old(customIrp) == customIrp) || !(myStatus == 0)) || !(MaximumInterfaceType <= 0)) || ((((((((((!(MPR3 <= 6) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(\old(s) <= MPR3)) || !(NP + 4 <= MPR1)) || !(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC) || (!(0 == pended) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(NP <= 1)) || !(MPR3 <= \old(s))) || !(\old(setEventCalled) <= 1)) && ((((((((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(1 <= \old(setEventCalled))) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(\old(setEventCalled) <= 1)) || !(myStatus + 1073741637 <= 0)) || ((\old(customIrp) == 1 && ((((((((((((((0 == pended && SKIP2 + 3 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && 0 == customIrp) || ((((((((((((((((0 == pended && SKIP2 + 3 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(MaximumInterfaceType <= 0))) && ((((((((((((((!(MPR3 <= 6) || !(1 <= NP)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC) || (!(0 == pended) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(NP <= 1)) || (1 == s && \old(customIrp) == customIrp)) || !(1 <= \old(setEventCalled))) || !(\old(s) <= MPR3)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) || !(MPR3 <= \old(s))) || !(\old(setEventCalled) <= 1))) && ((((((((((((((((!(MPR3 <= 6) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || ((((((((((((((((0 == pended && SKIP2 + 3 <= IPC) && PagingReferenceCount <= 1) && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && s <= NP) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && MPR3 <= 6) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 < PagingReferenceCount) && 6 <= MPR3) && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(1 <= \old(setEventCalled))) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(1 <= compRegistered)) || !(\old(customIrp) == 0)) || !(\old(setEventCalled) <= 1))) && (((((((!(NP + 5 <= MPR3) || !(1 == pended)) || s == NP) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(DC + 2 <= SKIP2))) && (((((((((((!(MPR3 <= 6) || (1 == s && \old(customIrp) == customIrp)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == pended)) || !(\old(customIrp) == 0))) && ((((1 == s && \old(customIrp) == customIrp) || !(myStatus + 1073741637 <= 0)) || !(MaximumInterfaceType <= 0)) || ((((((((((!(MPR3 <= 6) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(\old(s) <= MPR3)) || !(NP + 4 <= MPR1)) || !(SKIP1 + 2 <= MPR1) || !(SKIP2 + 3 <= IPC) || (!(0 == pended) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(PagingReferenceCount <= 1)) || !(6 <= MPR3)) || !(0 < PagingReferenceCount)) || !(NP <= 1)) || !(MPR3 <= \old(s))) || !(\old(setEventCalled) <= 1)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) + 1073741637 <= 0) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) || ((((((((((((((((myStatus == 0 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && s == \old(s)) && 0 == customIrp) && 1 == s) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) && (((!(\old(myStatus) == 0) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) || ((((((((((((((((myStatus == 0 && 0 == pended) && 0 == compRegistered) && PagingReferenceCount <= 1) && s == \old(s)) && 0 == customIrp) && 1 == s) && MPR3 <= 6) && \old(customIrp) == customIrp) && 6 <= MPR3) && s == NP) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && 0 == ntStatus) && DC + 2 <= SKIP2) && 0 < PagingReferenceCount)) - InvariantResult [Line: 1133]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((!(\old(myStatus) + 1073741637 <= 0) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) || ((((((((0 == pended && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && s == \old(s)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) && (((!(\old(myStatus) == 0) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) || ((((((((0 == pended && s == NP) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && SKIP1 + 2 <= MPR1) && s == \old(s)) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) - InvariantResult [Line: 1329]: Loop Invariant Derived loop invariant: (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || (((0 == pended && PagingReferenceCount <= 0) && 1 == s) && 0 <= PagingReferenceCount)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((((((((1 == pended && s == NP) && 0 == compRegistered) || !(\old(myStatus) + 1073741637 <= 0)) || !(MaximumInterfaceType <= 0)) || (!(259 == ntStatus) && (PagingReferenceCount <= 1 && 0 == pended && s == DC) && 0 < PagingReferenceCount)) || ((1 == pended && 0 == compRegistered) && s == DC)) || (((s == SKIP2 && 0 == pended) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || (((s == IPC && 0 == pended) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((s == IPC && 1 == pended) && 0 == compRegistered)) || (ntStatus + 1073741823 <= 0 && 0 == pended && s == DC)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || ((((((1 == pended && s == SKIP2) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) && ((((((((((((1 == pended && s == NP) && 0 == compRegistered) || !(\old(myStatus) == 0)) || !(MaximumInterfaceType <= 0)) || (!(259 == ntStatus) && (PagingReferenceCount <= 1 && 0 == pended && s == DC) && 0 < PagingReferenceCount)) || ((1 == pended && 0 == compRegistered) && s == DC)) || (((s == SKIP2 && 0 == pended) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || (((s == IPC && 0 == pended) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((s == IPC && 1 == pended) && 0 == compRegistered)) || (ntStatus + 1073741823 <= 0 && 0 == pended && s == DC)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(customIrp) == 0)) || ((((((1 == pended && s == SKIP2) && NP + 5 <= MPR3) && 0 == compRegistered) && SKIP2 + 3 <= IPC) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1375]: Loop Invariant Derived loop invariant: (((((((((((!(MPR3 <= 6) || (0 == pended && s == NP)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(\old(PagingReferenceCount) <= 0)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(0 <= \old(PagingReferenceCount))) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(compRegistered == 0)) || !(0 == \old(pended)) - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: (((((((1 <= compRegistered && 1 == s) && ntStatus == \old(myStatus)) && myStatus == \old(myStatus)) || ((ntStatus == 0 && 1 <= compRegistered && 1 == s) && myStatus == \old(myStatus))) || !(\old(myStatus) == 0)) || !(MaximumInterfaceType <= 0)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) && ((((0 < ntStatus + 1 && ((((1 <= compRegistered && 1 == s) && ntStatus == \old(myStatus)) && myStatus == \old(myStatus)) || ((ntStatus == 0 && 1 <= compRegistered && 1 == s) && myStatus == \old(myStatus)))) || !(\old(myStatus) + 1073741637 <= 0)) || !(MaximumInterfaceType <= 0)) || (((((((((((!(MPR3 <= 6) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(6 <= MPR3)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(SKIP2 + 3 <= IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(PagingReferenceCount <= 1)) || !(0 < PagingReferenceCount)) || !(\old(customIrp) == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 392 locations, 1 error locations. SAFE Result, 69.7s OverallTime, 69 OverallIterations, 2 TraceHistogramMax, 17.1s AutomataDifference, 0.0s DeadEndRemovalTime, 40.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 27662 SDtfs, 12813 SDslu, 83569 SDs, 0 SdLazy, 11868 SolverSat, 1820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1109 GetRequests, 639 SyntacticMatches, 14 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1142occurred in iteration=31, 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: 3.4s AutomataMinimizationTime, 69 MinimizatonAttempts, 2287 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 142 LocationsWithAnnotation, 2807 PreInvPairs, 3234 NumberOfFragments, 21320 HoareAnnotationTreeSize, 2807 FomulaSimplifications, 895705 FormulaSimplificationTreeSizeReduction, 3.1s HoareSimplificationTime, 142 FomulaSimplificationsInter, 379948 FormulaSimplificationTreeSizeReductionInter, 37.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 5560 NumberOfCodeBlocks, 5560 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 5488 ConstructedInterpolants, 0 QuantifiedInterpolants, 903276 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3754 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 72 InterpolantComputations, 69 PerfectInterpolantSequences, 401/410 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...