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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:49:42,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:49:42,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:49:42,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:49:42,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:49:42,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:49:42,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:49:42,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:49:42,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:49:42,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:49:42,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:49:42,755 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:49:42,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:49:42,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:49:42,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:49:42,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:49:42,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:49:42,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:49:42,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:49:42,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:49:42,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:49:42,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:49:42,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:49:42,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:49:42,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:49:42,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:49:42,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:49:42,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:49:42,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:49:42,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:49:42,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:49:42,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:49:42,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:49:42,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:49:42,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:49:42,785 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:49:42,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:49:42,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:49:42,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:49:42,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:49:42,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:49:42,789 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-10-07 13:49:42,813 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:49:42,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:49:42,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:49:42,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:49:42,815 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:49:42,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:49:42,815 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:49:42,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:49:42,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:49:42,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:49:42,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:49:42,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:49:42,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:49:42,817 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:49:42,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:49:42,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:49:42,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:49:42,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:49:42,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:49:42,818 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:49:42,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:49:42,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:49:42,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:49:42,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:49:42,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:49:42,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:49:42,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:49:42,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:49:42,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:49:43,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:49:43,153 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:49:43,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:49:43,158 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:49:43,159 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:49:43,159 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-10-07 13:49:43,232 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588f37e96/e6afd4422feb4ef3a23b3c29dade51d2/FLAG15a945d49 [2019-10-07 13:49:43,790 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:49:43,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-07 13:49:43,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588f37e96/e6afd4422feb4ef3a23b3c29dade51d2/FLAG15a945d49 [2019-10-07 13:49:44,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/588f37e96/e6afd4422feb4ef3a23b3c29dade51d2 [2019-10-07 13:49:44,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:49:44,054 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:49:44,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:49:44,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:49:44,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:49:44,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:49:44" (1/1) ... [2019-10-07 13:49:44,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45859c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44, skipping insertion in model container [2019-10-07 13:49:44,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:49:44" (1/1) ... [2019-10-07 13:49:44,074 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:49:44,141 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:49:44,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:49:44,621 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:49:44,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:49:44,787 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:49:44,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44 WrapperNode [2019-10-07 13:49:44,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:49:44,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:49:44,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:49:44,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:49:44,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44" (1/1) ... [2019-10-07 13:49:44,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44" (1/1) ... [2019-10-07 13:49:44,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44" (1/1) ... [2019-10-07 13:49:44,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44" (1/1) ... [2019-10-07 13:49:44,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44" (1/1) ... [2019-10-07 13:49:44,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44" (1/1) ... [2019-10-07 13:49:44,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44" (1/1) ... [2019-10-07 13:49:44,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:49:44,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:49:44,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:49:44,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:49:44,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44" (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-10-07 13:49:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:49:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:49:44,946 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-07 13:49:44,947 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-07 13:49:44,947 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-07 13:49:44,947 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-07 13:49:44,947 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-07 13:49:44,947 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-07 13:49:44,947 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-07 13:49:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-07 13:49:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-07 13:49:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:49:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-07 13:49:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-07 13:49:44,948 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-07 13:49:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-07 13:49:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-07 13:49:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-07 13:49:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-07 13:49:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-07 13:49:44,949 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-07 13:49:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-07 13:49:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-07 13:49:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-07 13:49:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-07 13:49:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-07 13:49:44,950 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-10-07 13:49:44,951 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-10-07 13:49:44,951 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-10-07 13:49:44,951 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-07 13:49:44,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:49:44,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:49:44,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:49:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-07 13:49:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 13:49:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-07 13:49:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-07 13:49:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-07 13:49:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-07 13:49:44,952 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-07 13:49:44,953 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-07 13:49:44,953 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-07 13:49:44,953 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-07 13:49:44,953 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-07 13:49:44,953 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-07 13:49:44,953 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-07 13:49:44,953 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-07 13:49:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-07 13:49:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-07 13:49:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-07 13:49:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-07 13:49:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-07 13:49:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-07 13:49:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-10-07 13:49:44,954 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-10-07 13:49:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-10-07 13:49:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-07 13:49:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-07 13:49:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-07 13:49:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-07 13:49:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-07 13:49:44,955 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:49:44,956 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-07 13:49:44,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:49:44,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:49:45,356 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:45,461 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:45,462 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:45,484 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:45,494 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:45,495 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:45,501 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:45,745 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-07 13:49:45,745 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-07 13:49:45,752 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:45,852 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-10-07 13:49:45,852 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-10-07 13:49:45,868 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:45,898 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-07 13:49:45,898 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-07 13:49:46,047 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:46,063 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:46,064 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:46,064 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:46,074 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:46,074 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:46,075 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:46,084 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:46,084 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:46,122 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:46,156 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-07 13:49:46,157 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-07 13:49:46,160 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:46,286 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-10-07 13:49:46,286 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-10-07 13:49:46,347 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:46,354 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:46,354 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:46,355 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:46,363 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:46,363 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:46,363 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:46,371 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:46,372 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:46,776 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:49:46,776 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:49:46,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:49:46 BoogieIcfgContainer [2019-10-07 13:49:46,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:49:46,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:49:46,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:49:46,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:49:46,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:49:44" (1/3) ... [2019-10-07 13:49:46,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1de08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:49:46, skipping insertion in model container [2019-10-07 13:49:46,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:44" (2/3) ... [2019-10-07 13:49:46,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1de08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:49:46, skipping insertion in model container [2019-10-07 13:49:46,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:49:46" (3/3) ... [2019-10-07 13:49:46,787 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-10-07 13:49:46,799 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:49:46,808 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:49:46,822 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:49:46,855 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:49:46,856 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:49:46,856 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:49:46,856 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:49:46,856 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:49:46,856 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:49:46,857 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:49:46,857 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:49:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states. [2019-10-07 13:49:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:49:46,895 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:46,896 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:46,898 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:46,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:46,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1462923013, now seen corresponding path program 1 times [2019-10-07 13:49:46,917 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:46,917 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:46,918 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:46,918 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:47,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:47,313 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:47,314 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:47,314 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:47,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:47,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:47,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:47,365 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 3 states. [2019-10-07 13:49:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:47,703 INFO L93 Difference]: Finished difference Result 591 states and 867 transitions. [2019-10-07 13:49:47,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:47,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-07 13:49:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:47,722 INFO L225 Difference]: With dead ends: 591 [2019-10-07 13:49:47,722 INFO L226 Difference]: Without dead ends: 383 [2019-10-07 13:49:47,729 INFO L606 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-10-07 13:49:47,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-07 13:49:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 366. [2019-10-07 13:49:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-07 13:49:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 486 transitions. [2019-10-07 13:49:47,814 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 486 transitions. Word has length 21 [2019-10-07 13:49:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:47,815 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 486 transitions. [2019-10-07 13:49:47,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 486 transitions. [2019-10-07 13:49:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:49:47,817 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:47,817 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:47,818 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:47,818 INFO L82 PathProgramCache]: Analyzing trace with hash 738687115, now seen corresponding path program 1 times [2019-10-07 13:49:47,818 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:47,818 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:47,819 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:47,819 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:47,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:47,896 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:47,897 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:47,897 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:47,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:47,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:47,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:47,899 INFO L87 Difference]: Start difference. First operand 366 states and 486 transitions. Second operand 3 states. [2019-10-07 13:49:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:47,937 INFO L93 Difference]: Finished difference Result 384 states and 509 transitions. [2019-10-07 13:49:47,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:47,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-07 13:49:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:47,942 INFO L225 Difference]: With dead ends: 384 [2019-10-07 13:49:47,942 INFO L226 Difference]: Without dead ends: 366 [2019-10-07 13:49:47,943 INFO L606 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-10-07 13:49:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-10-07 13:49:47,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-10-07 13:49:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-07 13:49:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 485 transitions. [2019-10-07 13:49:47,976 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 485 transitions. Word has length 18 [2019-10-07 13:49:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:47,976 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 485 transitions. [2019-10-07 13:49:47,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 485 transitions. [2019-10-07 13:49:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-07 13:49:47,978 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:47,978 INFO L385 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] [2019-10-07 13:49:47,978 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1792373602, now seen corresponding path program 1 times [2019-10-07 13:49:47,979 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:47,979 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:47,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:47,980 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:48,098 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,098 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:48,098 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:48,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:48,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:48,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:48,100 INFO L87 Difference]: Start difference. First operand 366 states and 485 transitions. Second operand 3 states. [2019-10-07 13:49:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:48,154 INFO L93 Difference]: Finished difference Result 462 states and 604 transitions. [2019-10-07 13:49:48,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:48,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-07 13:49:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:48,159 INFO L225 Difference]: With dead ends: 462 [2019-10-07 13:49:48,159 INFO L226 Difference]: Without dead ends: 443 [2019-10-07 13:49:48,160 INFO L606 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-10-07 13:49:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-07 13:49:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 421. [2019-10-07 13:49:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-10-07 13:49:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 552 transitions. [2019-10-07 13:49:48,192 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 552 transitions. Word has length 26 [2019-10-07 13:49:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:48,192 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 552 transitions. [2019-10-07 13:49:48,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 552 transitions. [2019-10-07 13:49:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 13:49:48,194 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:48,194 INFO L385 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] [2019-10-07 13:49:48,194 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:48,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:48,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1021087200, now seen corresponding path program 1 times [2019-10-07 13:49:48,195 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:48,195 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,195 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,196 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:48,252 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,253 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:48,253 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:48,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:48,254 INFO L87 Difference]: Start difference. First operand 421 states and 552 transitions. Second operand 3 states. [2019-10-07 13:49:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:48,301 INFO L93 Difference]: Finished difference Result 753 states and 984 transitions. [2019-10-07 13:49:48,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:48,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-07 13:49:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:48,308 INFO L225 Difference]: With dead ends: 753 [2019-10-07 13:49:48,308 INFO L226 Difference]: Without dead ends: 560 [2019-10-07 13:49:48,310 INFO L606 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-10-07 13:49:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-07 13:49:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 534. [2019-10-07 13:49:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-07 13:49:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 705 transitions. [2019-10-07 13:49:48,343 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 705 transitions. Word has length 27 [2019-10-07 13:49:48,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:48,344 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 705 transitions. [2019-10-07 13:49:48,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:48,344 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 705 transitions. [2019-10-07 13:49:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 13:49:48,347 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:48,347 INFO L385 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] [2019-10-07 13:49:48,347 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:48,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:48,347 INFO L82 PathProgramCache]: Analyzing trace with hash 576858905, now seen corresponding path program 1 times [2019-10-07 13:49:48,348 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:48,348 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,348 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,348 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:48,446 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,446 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:48,446 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:48,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:48,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:48,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:48,448 INFO L87 Difference]: Start difference. First operand 534 states and 705 transitions. Second operand 3 states. [2019-10-07 13:49:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:48,572 INFO L93 Difference]: Finished difference Result 543 states and 716 transitions. [2019-10-07 13:49:48,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:48,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-07 13:49:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:48,577 INFO L225 Difference]: With dead ends: 543 [2019-10-07 13:49:48,577 INFO L226 Difference]: Without dead ends: 540 [2019-10-07 13:49:48,578 INFO L606 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-10-07 13:49:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-07 13:49:48,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-10-07 13:49:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-10-07 13:49:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 712 transitions. [2019-10-07 13:49:48,614 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 712 transitions. Word has length 32 [2019-10-07 13:49:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:48,614 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 712 transitions. [2019-10-07 13:49:48,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 712 transitions. [2019-10-07 13:49:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-07 13:49:48,621 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:48,621 INFO L385 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-10-07 13:49:48,622 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:48,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:48,622 INFO L82 PathProgramCache]: Analyzing trace with hash 693216730, now seen corresponding path program 1 times [2019-10-07 13:49:48,622 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:48,622 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,623 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,623 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:48,663 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,663 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:48,663 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:48,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:48,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:48,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:48,664 INFO L87 Difference]: Start difference. First operand 540 states and 712 transitions. Second operand 3 states. [2019-10-07 13:49:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:48,751 INFO L93 Difference]: Finished difference Result 572 states and 748 transitions. [2019-10-07 13:49:48,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:48,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-07 13:49:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:48,758 INFO L225 Difference]: With dead ends: 572 [2019-10-07 13:49:48,758 INFO L226 Difference]: Without dead ends: 567 [2019-10-07 13:49:48,759 INFO L606 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-10-07 13:49:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-07 13:49:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 565. [2019-10-07 13:49:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-07 13:49:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 741 transitions. [2019-10-07 13:49:48,790 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 741 transitions. Word has length 33 [2019-10-07 13:49:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:48,791 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 741 transitions. [2019-10-07 13:49:48,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 741 transitions. [2019-10-07 13:49:48,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-07 13:49:48,793 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:48,793 INFO L385 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] [2019-10-07 13:49:48,793 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:48,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:48,794 INFO L82 PathProgramCache]: Analyzing trace with hash 466530989, now seen corresponding path program 1 times [2019-10-07 13:49:48,794 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:48,794 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,794 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,794 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:48,851 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,852 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:48,852 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:48,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:48,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:48,853 INFO L87 Difference]: Start difference. First operand 565 states and 741 transitions. Second operand 5 states. [2019-10-07 13:49:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:48,900 INFO L93 Difference]: Finished difference Result 578 states and 755 transitions. [2019-10-07 13:49:48,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:48,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-10-07 13:49:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:48,904 INFO L225 Difference]: With dead ends: 578 [2019-10-07 13:49:48,905 INFO L226 Difference]: Without dead ends: 563 [2019-10-07 13:49:48,905 INFO L606 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-10-07 13:49:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-07 13:49:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-07 13:49:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-07 13:49:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 737 transitions. [2019-10-07 13:49:48,932 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 737 transitions. Word has length 34 [2019-10-07 13:49:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:48,933 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 737 transitions. [2019-10-07 13:49:48,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 737 transitions. [2019-10-07 13:49:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-07 13:49:48,934 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:48,935 INFO L385 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] [2019-10-07 13:49:48,935 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:48,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:48,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2017596672, now seen corresponding path program 1 times [2019-10-07 13:49:48,935 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:48,936 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,936 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,936 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:48,979 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,980 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:48,980 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:48,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:48,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:48,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:48,981 INFO L87 Difference]: Start difference. First operand 563 states and 737 transitions. Second operand 5 states. [2019-10-07 13:49:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:49,028 INFO L93 Difference]: Finished difference Result 576 states and 751 transitions. [2019-10-07 13:49:49,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:49,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-07 13:49:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:49,032 INFO L225 Difference]: With dead ends: 576 [2019-10-07 13:49:49,033 INFO L226 Difference]: Without dead ends: 557 [2019-10-07 13:49:49,033 INFO L606 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-10-07 13:49:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-10-07 13:49:49,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2019-10-07 13:49:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-10-07 13:49:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 729 transitions. [2019-10-07 13:49:49,058 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 729 transitions. Word has length 35 [2019-10-07 13:49:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:49,059 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 729 transitions. [2019-10-07 13:49:49,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 729 transitions. [2019-10-07 13:49:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-07 13:49:49,060 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:49,061 INFO L385 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-10-07 13:49:49,061 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1856256589, now seen corresponding path program 1 times [2019-10-07 13:49:49,061 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:49,062 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:49,062 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:49,062 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:49,107 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:49,107 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:49,107 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:49,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:49,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:49,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:49,109 INFO L87 Difference]: Start difference. First operand 557 states and 729 transitions. Second operand 3 states. [2019-10-07 13:49:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:49,277 INFO L93 Difference]: Finished difference Result 713 states and 945 transitions. [2019-10-07 13:49:49,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:49,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-07 13:49:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:49,283 INFO L225 Difference]: With dead ends: 713 [2019-10-07 13:49:49,284 INFO L226 Difference]: Without dead ends: 710 [2019-10-07 13:49:49,284 INFO L606 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-10-07 13:49:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-07 13:49:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 603. [2019-10-07 13:49:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-07 13:49:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 793 transitions. [2019-10-07 13:49:49,321 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 793 transitions. Word has length 38 [2019-10-07 13:49:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:49,323 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 793 transitions. [2019-10-07 13:49:49,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 793 transitions. [2019-10-07 13:49:49,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-07 13:49:49,326 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:49,326 INFO L385 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-10-07 13:49:49,326 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:49,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:49,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1471321743, now seen corresponding path program 1 times [2019-10-07 13:49:49,327 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:49,327 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:49,327 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:49,327 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:49,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:49,479 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:49,479 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:49,479 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:49,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:49,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:49,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:49,480 INFO L87 Difference]: Start difference. First operand 603 states and 793 transitions. Second operand 8 states. [2019-10-07 13:49:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:50,288 INFO L93 Difference]: Finished difference Result 792 states and 1035 transitions. [2019-10-07 13:49:50,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:49:50,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-07 13:49:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:50,293 INFO L225 Difference]: With dead ends: 792 [2019-10-07 13:49:50,293 INFO L226 Difference]: Without dead ends: 723 [2019-10-07 13:49:50,294 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-10-07 13:49:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 597. [2019-10-07 13:49:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-07 13:49:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 779 transitions. [2019-10-07 13:49:50,356 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 779 transitions. Word has length 39 [2019-10-07 13:49:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:50,356 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 779 transitions. [2019-10-07 13:49:50,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 779 transitions. [2019-10-07 13:49:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 13:49:50,358 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:50,358 INFO L385 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] [2019-10-07 13:49:50,358 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:50,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash -58105418, now seen corresponding path program 1 times [2019-10-07 13:49:50,359 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:50,359 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:50,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:50,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:50,416 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:50,417 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:50,417 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:49:50,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:49:50,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:49:50,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:49:50,418 INFO L87 Difference]: Start difference. First operand 597 states and 779 transitions. Second operand 4 states. [2019-10-07 13:49:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:50,482 INFO L93 Difference]: Finished difference Result 625 states and 812 transitions. [2019-10-07 13:49:50,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:49:50,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-07 13:49:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:50,486 INFO L225 Difference]: With dead ends: 625 [2019-10-07 13:49:50,486 INFO L226 Difference]: Without dead ends: 603 [2019-10-07 13:49:50,487 INFO L606 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-10-07 13:49:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-07 13:49:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 599. [2019-10-07 13:49:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-07 13:49:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 781 transitions. [2019-10-07 13:49:50,517 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 781 transitions. Word has length 37 [2019-10-07 13:49:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:50,518 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 781 transitions. [2019-10-07 13:49:50,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:49:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 781 transitions. [2019-10-07 13:49:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-07 13:49:50,519 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:50,519 INFO L385 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-10-07 13:49:50,520 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:50,520 INFO L82 PathProgramCache]: Analyzing trace with hash 898299433, now seen corresponding path program 1 times [2019-10-07 13:49:50,520 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:50,520 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:50,520 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:50,521 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:50,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:50,601 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:50,601 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:50,601 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:50,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:50,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:50,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:50,602 INFO L87 Difference]: Start difference. First operand 599 states and 781 transitions. Second operand 8 states. [2019-10-07 13:49:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:51,186 INFO L93 Difference]: Finished difference Result 621 states and 803 transitions. [2019-10-07 13:49:51,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:51,186 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-07 13:49:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:51,190 INFO L225 Difference]: With dead ends: 621 [2019-10-07 13:49:51,190 INFO L226 Difference]: Without dead ends: 615 [2019-10-07 13:49:51,191 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-07 13:49:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 599. [2019-10-07 13:49:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-07 13:49:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 780 transitions. [2019-10-07 13:49:51,248 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 780 transitions. Word has length 39 [2019-10-07 13:49:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:51,249 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 780 transitions. [2019-10-07 13:49:51,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 780 transitions. [2019-10-07 13:49:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 13:49:51,253 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:51,253 INFO L385 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-10-07 13:49:51,253 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:51,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1216858283, now seen corresponding path program 1 times [2019-10-07 13:49:51,254 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:51,254 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:51,254 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:51,255 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:51,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:51,360 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:51,361 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:51,361 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:51,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:51,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:51,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:51,363 INFO L87 Difference]: Start difference. First operand 599 states and 780 transitions. Second operand 8 states. [2019-10-07 13:49:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:51,923 INFO L93 Difference]: Finished difference Result 621 states and 801 transitions. [2019-10-07 13:49:51,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:51,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-10-07 13:49:51,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:51,928 INFO L225 Difference]: With dead ends: 621 [2019-10-07 13:49:51,928 INFO L226 Difference]: Without dead ends: 615 [2019-10-07 13:49:51,929 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-07 13:49:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 599. [2019-10-07 13:49:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-07 13:49:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 779 transitions. [2019-10-07 13:49:51,958 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 779 transitions. Word has length 40 [2019-10-07 13:49:51,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:51,958 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 779 transitions. [2019-10-07 13:49:51,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 779 transitions. [2019-10-07 13:49:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 13:49:51,960 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:51,960 INFO L385 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-10-07 13:49:51,960 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:51,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1560994504, now seen corresponding path program 1 times [2019-10-07 13:49:51,961 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:51,961 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:51,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:51,961 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:51,998 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:51,998 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:51,999 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:51,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:51,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:51,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:52,000 INFO L87 Difference]: Start difference. First operand 599 states and 779 transitions. Second operand 3 states. [2019-10-07 13:49:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:52,043 INFO L93 Difference]: Finished difference Result 639 states and 826 transitions. [2019-10-07 13:49:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:52,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-07 13:49:52,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:52,047 INFO L225 Difference]: With dead ends: 639 [2019-10-07 13:49:52,047 INFO L226 Difference]: Without dead ends: 576 [2019-10-07 13:49:52,048 INFO L606 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-10-07 13:49:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-07 13:49:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 573. [2019-10-07 13:49:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-07 13:49:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 744 transitions. [2019-10-07 13:49:52,079 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 744 transitions. Word has length 40 [2019-10-07 13:49:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:52,079 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 744 transitions. [2019-10-07 13:49:52,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 744 transitions. [2019-10-07 13:49:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:49:52,081 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:52,081 INFO L385 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] [2019-10-07 13:49:52,081 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:52,081 INFO L82 PathProgramCache]: Analyzing trace with hash -848551918, now seen corresponding path program 1 times [2019-10-07 13:49:52,082 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:52,082 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,082 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,082 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:52,133 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,133 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:52,133 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:52,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:52,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:52,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:52,135 INFO L87 Difference]: Start difference. First operand 573 states and 744 transitions. Second operand 5 states. [2019-10-07 13:49:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:52,183 INFO L93 Difference]: Finished difference Result 589 states and 759 transitions. [2019-10-07 13:49:52,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:52,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-07 13:49:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:52,187 INFO L225 Difference]: With dead ends: 589 [2019-10-07 13:49:52,187 INFO L226 Difference]: Without dead ends: 571 [2019-10-07 13:49:52,189 INFO L606 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-10-07 13:49:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-07 13:49:52,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-07 13:49:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-07 13:49:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 740 transitions. [2019-10-07 13:49:52,223 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 740 transitions. Word has length 41 [2019-10-07 13:49:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:52,224 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 740 transitions. [2019-10-07 13:49:52,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 740 transitions. [2019-10-07 13:49:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:49:52,226 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:52,226 INFO L385 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-10-07 13:49:52,226 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1321910963, now seen corresponding path program 1 times [2019-10-07 13:49:52,227 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:52,227 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,228 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,228 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:52,315 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,315 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:52,315 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:49:52,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:49:52,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:49:52,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:49:52,316 INFO L87 Difference]: Start difference. First operand 571 states and 740 transitions. Second operand 4 states. [2019-10-07 13:49:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:52,510 INFO L93 Difference]: Finished difference Result 621 states and 784 transitions. [2019-10-07 13:49:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:49:52,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-07 13:49:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:52,513 INFO L225 Difference]: With dead ends: 621 [2019-10-07 13:49:52,513 INFO L226 Difference]: Without dead ends: 432 [2019-10-07 13:49:52,514 INFO L606 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-10-07 13:49:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-10-07 13:49:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 413. [2019-10-07 13:49:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-10-07 13:49:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 516 transitions. [2019-10-07 13:49:52,535 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 516 transitions. Word has length 43 [2019-10-07 13:49:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:52,536 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 516 transitions. [2019-10-07 13:49:52,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:49:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 516 transitions. [2019-10-07 13:49:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-07 13:49:52,537 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:52,537 INFO L385 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] [2019-10-07 13:49:52,538 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:52,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash -360854459, now seen corresponding path program 1 times [2019-10-07 13:49:52,538 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:52,538 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,538 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,538 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:52,591 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,591 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:52,591 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:52,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:52,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:52,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:52,592 INFO L87 Difference]: Start difference. First operand 413 states and 516 transitions. Second operand 5 states. [2019-10-07 13:49:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:52,630 INFO L93 Difference]: Finished difference Result 429 states and 531 transitions. [2019-10-07 13:49:52,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:52,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-07 13:49:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:52,633 INFO L225 Difference]: With dead ends: 429 [2019-10-07 13:49:52,633 INFO L226 Difference]: Without dead ends: 411 [2019-10-07 13:49:52,635 INFO L606 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-10-07 13:49:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-07 13:49:52,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2019-10-07 13:49:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-07 13:49:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 512 transitions. [2019-10-07 13:49:52,655 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 512 transitions. Word has length 41 [2019-10-07 13:49:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:52,655 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 512 transitions. [2019-10-07 13:49:52,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 512 transitions. [2019-10-07 13:49:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:49:52,657 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:52,657 INFO L385 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-10-07 13:49:52,657 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:52,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:52,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1939669222, now seen corresponding path program 1 times [2019-10-07 13:49:52,657 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:52,658 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,658 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,658 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:52,695 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,695 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:52,695 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:52,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:52,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:52,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:52,696 INFO L87 Difference]: Start difference. First operand 411 states and 512 transitions. Second operand 3 states. [2019-10-07 13:49:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:52,812 INFO L93 Difference]: Finished difference Result 566 states and 717 transitions. [2019-10-07 13:49:52,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:52,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-07 13:49:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:52,815 INFO L225 Difference]: With dead ends: 566 [2019-10-07 13:49:52,816 INFO L226 Difference]: Without dead ends: 542 [2019-10-07 13:49:52,816 INFO L606 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-10-07 13:49:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-10-07 13:49:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 445. [2019-10-07 13:49:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-07 13:49:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 555 transitions. [2019-10-07 13:49:52,853 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 555 transitions. Word has length 43 [2019-10-07 13:49:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:52,853 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 555 transitions. [2019-10-07 13:49:52,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 555 transitions. [2019-10-07 13:49:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:49:52,855 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:52,856 INFO L385 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-10-07 13:49:52,856 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:52,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:52,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1952247639, now seen corresponding path program 1 times [2019-10-07 13:49:52,856 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:52,857 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,857 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,857 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:52,919 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,920 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:52,920 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:52,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:52,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:52,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:52,923 INFO L87 Difference]: Start difference. First operand 445 states and 555 transitions. Second operand 3 states. [2019-10-07 13:49:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:53,015 INFO L93 Difference]: Finished difference Result 626 states and 787 transitions. [2019-10-07 13:49:53,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:53,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-07 13:49:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:53,023 INFO L225 Difference]: With dead ends: 626 [2019-10-07 13:49:53,023 INFO L226 Difference]: Without dead ends: 448 [2019-10-07 13:49:53,025 INFO L606 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-10-07 13:49:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-10-07 13:49:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-10-07 13:49:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-07 13:49:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 559 transitions. [2019-10-07 13:49:53,058 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 559 transitions. Word has length 51 [2019-10-07 13:49:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:53,059 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 559 transitions. [2019-10-07 13:49:53,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 559 transitions. [2019-10-07 13:49:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:49:53,061 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:53,061 INFO L385 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-10-07 13:49:53,061 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash 452129407, now seen corresponding path program 1 times [2019-10-07 13:49:53,062 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:53,062 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:53,063 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:53,063 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:53,147 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:53,148 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:53,148 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:53,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:53,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:53,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:53,149 INFO L87 Difference]: Start difference. First operand 448 states and 559 transitions. Second operand 8 states. [2019-10-07 13:49:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:53,332 INFO L93 Difference]: Finished difference Result 478 states and 593 transitions. [2019-10-07 13:49:53,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:53,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-07 13:49:53,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:53,336 INFO L225 Difference]: With dead ends: 478 [2019-10-07 13:49:53,336 INFO L226 Difference]: Without dead ends: 474 [2019-10-07 13:49:53,336 INFO L606 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-10-07 13:49:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-07 13:49:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 466. [2019-10-07 13:49:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-07 13:49:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 580 transitions. [2019-10-07 13:49:53,360 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 580 transitions. Word has length 44 [2019-10-07 13:49:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:53,360 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 580 transitions. [2019-10-07 13:49:53,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 580 transitions. [2019-10-07 13:49:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:49:53,362 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:53,362 INFO L385 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-10-07 13:49:53,362 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:53,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash 451852577, now seen corresponding path program 1 times [2019-10-07 13:49:53,362 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:53,363 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:53,363 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:53,363 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:53,492 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:53,492 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:53,493 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:49:53,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:49:53,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:49:53,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:49:53,494 INFO L87 Difference]: Start difference. First operand 466 states and 580 transitions. Second operand 10 states. [2019-10-07 13:49:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:55,069 INFO L93 Difference]: Finished difference Result 568 states and 718 transitions. [2019-10-07 13:49:55,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:55,070 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-10-07 13:49:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:55,074 INFO L225 Difference]: With dead ends: 568 [2019-10-07 13:49:55,075 INFO L226 Difference]: Without dead ends: 552 [2019-10-07 13:49:55,075 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:49:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-10-07 13:49:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 479. [2019-10-07 13:49:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-10-07 13:49:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 594 transitions. [2019-10-07 13:49:55,111 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 594 transitions. Word has length 44 [2019-10-07 13:49:55,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:55,111 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 594 transitions. [2019-10-07 13:49:55,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:49:55,112 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 594 transitions. [2019-10-07 13:49:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:49:55,113 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:55,113 INFO L385 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-10-07 13:49:55,113 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:55,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1045295946, now seen corresponding path program 1 times [2019-10-07 13:49:55,114 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:55,114 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:55,114 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:55,114 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:55,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:55,208 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:55,208 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:55,209 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:49:55,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:49:55,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:49:55,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:55,210 INFO L87 Difference]: Start difference. First operand 479 states and 594 transitions. Second operand 7 states. [2019-10-07 13:49:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:55,856 INFO L93 Difference]: Finished difference Result 569 states and 702 transitions. [2019-10-07 13:49:55,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-07 13:49:55,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-10-07 13:49:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:55,862 INFO L225 Difference]: With dead ends: 569 [2019-10-07 13:49:55,862 INFO L226 Difference]: Without dead ends: 498 [2019-10-07 13:49:55,863 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-07 13:49:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 490. [2019-10-07 13:49:55,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-07 13:49:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 606 transitions. [2019-10-07 13:49:55,896 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 606 transitions. Word has length 44 [2019-10-07 13:49:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:55,896 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 606 transitions. [2019-10-07 13:49:55,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:49:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 606 transitions. [2019-10-07 13:49:55,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 13:49:55,901 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:55,902 INFO L385 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-10-07 13:49:55,902 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:55,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:55,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1960933712, now seen corresponding path program 1 times [2019-10-07 13:49:55,902 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:55,902 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:55,903 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:55,903 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:55,999 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:55,999 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:55,999 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:49:56,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:49:56,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:49:56,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:56,000 INFO L87 Difference]: Start difference. First operand 490 states and 606 transitions. Second operand 7 states. [2019-10-07 13:49:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:56,158 INFO L93 Difference]: Finished difference Result 508 states and 623 transitions. [2019-10-07 13:49:56,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:56,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-10-07 13:49:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:56,161 INFO L225 Difference]: With dead ends: 508 [2019-10-07 13:49:56,161 INFO L226 Difference]: Without dead ends: 487 [2019-10-07 13:49:56,162 INFO L606 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-10-07 13:49:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-07 13:49:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 485. [2019-10-07 13:49:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-10-07 13:49:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 589 transitions. [2019-10-07 13:49:56,192 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 589 transitions. Word has length 45 [2019-10-07 13:49:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:56,193 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 589 transitions. [2019-10-07 13:49:56,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:49:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 589 transitions. [2019-10-07 13:49:56,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 13:49:56,198 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:56,198 INFO L385 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-10-07 13:49:56,198 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:56,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:56,198 INFO L82 PathProgramCache]: Analyzing trace with hash -519110175, now seen corresponding path program 1 times [2019-10-07 13:49:56,199 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:56,199 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:56,199 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:56,199 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:56,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-10-07 13:49:56,236 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:56,236 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:56,236 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:56,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:56,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:56,238 INFO L87 Difference]: Start difference. First operand 485 states and 589 transitions. Second operand 3 states. [2019-10-07 13:49:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:56,344 INFO L93 Difference]: Finished difference Result 569 states and 692 transitions. [2019-10-07 13:49:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:56,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-07 13:49:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:56,347 INFO L225 Difference]: With dead ends: 569 [2019-10-07 13:49:56,348 INFO L226 Difference]: Without dead ends: 516 [2019-10-07 13:49:56,349 INFO L606 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-10-07 13:49:56,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-10-07 13:49:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 467. [2019-10-07 13:49:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2019-10-07 13:49:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 573 transitions. [2019-10-07 13:49:56,385 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 573 transitions. Word has length 45 [2019-10-07 13:49:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:56,385 INFO L462 AbstractCegarLoop]: Abstraction has 467 states and 573 transitions. [2019-10-07 13:49:56,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 573 transitions. [2019-10-07 13:49:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:49:56,386 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:56,386 INFO L385 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-10-07 13:49:56,387 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:56,387 INFO L82 PathProgramCache]: Analyzing trace with hash -706098147, now seen corresponding path program 1 times [2019-10-07 13:49:56,387 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:56,387 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:56,387 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:56,387 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:56,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:56,510 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:56,510 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:56,510 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:56,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:56,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:56,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:56,511 INFO L87 Difference]: Start difference. First operand 467 states and 573 transitions. Second operand 5 states. [2019-10-07 13:49:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:56,550 INFO L93 Difference]: Finished difference Result 645 states and 802 transitions. [2019-10-07 13:49:56,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:56,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-07 13:49:56,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:56,553 INFO L225 Difference]: With dead ends: 645 [2019-10-07 13:49:56,554 INFO L226 Difference]: Without dead ends: 435 [2019-10-07 13:49:56,555 INFO L606 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-10-07 13:49:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-07 13:49:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-10-07 13:49:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-07 13:49:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 526 transitions. [2019-10-07 13:49:56,582 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 526 transitions. Word has length 53 [2019-10-07 13:49:56,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:56,583 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 526 transitions. [2019-10-07 13:49:56,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:56,583 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 526 transitions. [2019-10-07 13:49:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-07 13:49:56,584 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:56,585 INFO L385 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-10-07 13:49:56,585 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:56,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:56,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1539102598, now seen corresponding path program 1 times [2019-10-07 13:49:56,585 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:56,585 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:56,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:56,586 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:56,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:56,635 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:56,635 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:56,635 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:56,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:56,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:56,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:56,636 INFO L87 Difference]: Start difference. First operand 435 states and 526 transitions. Second operand 5 states. [2019-10-07 13:49:56,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:56,972 INFO L93 Difference]: Finished difference Result 449 states and 539 transitions. [2019-10-07 13:49:56,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:56,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-07 13:49:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:56,975 INFO L225 Difference]: With dead ends: 449 [2019-10-07 13:49:56,975 INFO L226 Difference]: Without dead ends: 431 [2019-10-07 13:49:56,976 INFO L606 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-10-07 13:49:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-07 13:49:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2019-10-07 13:49:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-07 13:49:57,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 512 transitions. [2019-10-07 13:49:57,001 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 512 transitions. Word has length 46 [2019-10-07 13:49:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:57,002 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 512 transitions. [2019-10-07 13:49:57,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:57,002 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 512 transitions. [2019-10-07 13:49:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:49:57,003 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:57,003 INFO L385 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-10-07 13:49:57,004 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:57,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1827396325, now seen corresponding path program 1 times [2019-10-07 13:49:57,004 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:57,004 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:57,004 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:57,005 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:57,069 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:57,069 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:57,070 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:57,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:57,070 INFO L87 Difference]: Start difference. First operand 423 states and 512 transitions. Second operand 8 states. [2019-10-07 13:49:57,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:57,130 INFO L93 Difference]: Finished difference Result 436 states and 524 transitions. [2019-10-07 13:49:57,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:57,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-07 13:49:57,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:57,133 INFO L225 Difference]: With dead ends: 436 [2019-10-07 13:49:57,133 INFO L226 Difference]: Without dead ends: 412 [2019-10-07 13:49:57,134 INFO L606 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-10-07 13:49:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-10-07 13:49:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2019-10-07 13:49:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-10-07 13:49:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 499 transitions. [2019-10-07 13:49:57,157 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 499 transitions. Word has length 47 [2019-10-07 13:49:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:57,157 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 499 transitions. [2019-10-07 13:49:57,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:57,157 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 499 transitions. [2019-10-07 13:49:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:49:57,158 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:57,158 INFO L385 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-10-07 13:49:57,159 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:57,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash 358397846, now seen corresponding path program 1 times [2019-10-07 13:49:57,159 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:57,159 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:57,159 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:57,160 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:57,214 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:57,214 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:57,214 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:57,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:57,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:57,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:57,215 INFO L87 Difference]: Start difference. First operand 412 states and 499 transitions. Second operand 8 states. [2019-10-07 13:49:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:57,358 INFO L93 Difference]: Finished difference Result 435 states and 522 transitions. [2019-10-07 13:49:57,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:57,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-07 13:49:57,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:57,361 INFO L225 Difference]: With dead ends: 435 [2019-10-07 13:49:57,361 INFO L226 Difference]: Without dead ends: 407 [2019-10-07 13:49:57,362 INFO L606 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-10-07 13:49:57,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-10-07 13:49:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2019-10-07 13:49:57,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-10-07 13:49:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 491 transitions. [2019-10-07 13:49:57,385 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 491 transitions. Word has length 47 [2019-10-07 13:49:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:57,385 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 491 transitions. [2019-10-07 13:49:57,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 491 transitions. [2019-10-07 13:49:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:49:57,387 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:57,387 INFO L385 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-10-07 13:49:57,388 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:57,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:57,388 INFO L82 PathProgramCache]: Analyzing trace with hash -933816145, now seen corresponding path program 1 times [2019-10-07 13:49:57,388 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:57,388 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:57,389 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:57,389 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:57,443 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:57,443 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:57,443 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:49:57,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:49:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:49:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:49:57,444 INFO L87 Difference]: Start difference. First operand 407 states and 491 transitions. Second operand 6 states. [2019-10-07 13:49:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:57,499 INFO L93 Difference]: Finished difference Result 436 states and 524 transitions. [2019-10-07 13:49:57,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:49:57,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-07 13:49:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:57,502 INFO L225 Difference]: With dead ends: 436 [2019-10-07 13:49:57,502 INFO L226 Difference]: Without dead ends: 409 [2019-10-07 13:49:57,503 INFO L606 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-10-07 13:49:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-07 13:49:57,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-07 13:49:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-07 13:49:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 493 transitions. [2019-10-07 13:49:57,556 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 493 transitions. Word has length 47 [2019-10-07 13:49:57,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:57,556 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 493 transitions. [2019-10-07 13:49:57,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:49:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 493 transitions. [2019-10-07 13:49:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 13:49:57,558 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:57,558 INFO L385 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-10-07 13:49:57,558 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash 971008662, now seen corresponding path program 1 times [2019-10-07 13:49:57,559 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:57,559 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:57,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:57,559 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:57,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:57,609 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:57,609 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:57,610 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:57,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:57,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:57,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:57,611 INFO L87 Difference]: Start difference. First operand 409 states and 493 transitions. Second operand 5 states. [2019-10-07 13:49:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:57,886 INFO L93 Difference]: Finished difference Result 587 states and 716 transitions. [2019-10-07 13:49:57,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:57,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-07 13:49:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:57,889 INFO L225 Difference]: With dead ends: 587 [2019-10-07 13:49:57,889 INFO L226 Difference]: Without dead ends: 409 [2019-10-07 13:49:57,890 INFO L606 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-10-07 13:49:57,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-07 13:49:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-07 13:49:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-07 13:49:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 492 transitions. [2019-10-07 13:49:57,913 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 492 transitions. Word has length 57 [2019-10-07 13:49:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:57,914 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 492 transitions. [2019-10-07 13:49:57,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 492 transitions. [2019-10-07 13:49:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-07 13:49:57,915 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:57,915 INFO L385 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-10-07 13:49:57,916 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:57,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:57,916 INFO L82 PathProgramCache]: Analyzing trace with hash -550061814, now seen corresponding path program 1 times [2019-10-07 13:49:57,916 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:57,916 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:57,916 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:57,916 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:58,013 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:58,013 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:58,013 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:49:58,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:49:58,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:49:58,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:58,014 INFO L87 Difference]: Start difference. First operand 409 states and 492 transitions. Second operand 7 states. [2019-10-07 13:49:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:58,322 INFO L93 Difference]: Finished difference Result 428 states and 512 transitions. [2019-10-07 13:49:58,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:49:58,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-10-07 13:49:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:58,325 INFO L225 Difference]: With dead ends: 428 [2019-10-07 13:49:58,325 INFO L226 Difference]: Without dead ends: 425 [2019-10-07 13:49:58,326 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-10-07 13:49:58,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 409. [2019-10-07 13:49:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-07 13:49:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 492 transitions. [2019-10-07 13:49:58,355 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 492 transitions. Word has length 58 [2019-10-07 13:49:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:58,356 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 492 transitions. [2019-10-07 13:49:58,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:49:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 492 transitions. [2019-10-07 13:49:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:49:58,357 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:58,357 INFO L385 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-10-07 13:49:58,358 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash 815295926, now seen corresponding path program 1 times [2019-10-07 13:49:58,358 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:58,358 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:58,358 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:58,359 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:58,425 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:58,425 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:58,425 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:58,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:58,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:58,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:58,426 INFO L87 Difference]: Start difference. First operand 409 states and 492 transitions. Second operand 9 states. [2019-10-07 13:49:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:58,605 INFO L93 Difference]: Finished difference Result 434 states and 517 transitions. [2019-10-07 13:49:58,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:58,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-10-07 13:49:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:58,608 INFO L225 Difference]: With dead ends: 434 [2019-10-07 13:49:58,608 INFO L226 Difference]: Without dead ends: 404 [2019-10-07 13:49:58,609 INFO L606 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-10-07 13:49:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-10-07 13:49:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2019-10-07 13:49:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-07 13:49:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 484 transitions. [2019-10-07 13:49:58,652 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 484 transitions. Word has length 50 [2019-10-07 13:49:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:58,652 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 484 transitions. [2019-10-07 13:49:58,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 484 transitions. [2019-10-07 13:49:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:49:58,655 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:58,655 INFO L385 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-10-07 13:49:58,655 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:58,656 INFO L82 PathProgramCache]: Analyzing trace with hash 298589759, now seen corresponding path program 1 times [2019-10-07 13:49:58,656 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:58,656 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:58,656 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:58,657 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:58,750 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:58,750 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:58,750 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:58,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:58,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:58,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:58,751 INFO L87 Difference]: Start difference. First operand 404 states and 484 transitions. Second operand 9 states. [2019-10-07 13:49:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:58,985 INFO L93 Difference]: Finished difference Result 429 states and 509 transitions. [2019-10-07 13:49:58,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:58,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-10-07 13:49:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:58,988 INFO L225 Difference]: With dead ends: 429 [2019-10-07 13:49:58,989 INFO L226 Difference]: Without dead ends: 399 [2019-10-07 13:49:58,990 INFO L606 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-10-07 13:49:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-07 13:49:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-10-07 13:49:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-10-07 13:49:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 476 transitions. [2019-10-07 13:49:59,100 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 476 transitions. Word has length 50 [2019-10-07 13:49:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:59,101 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 476 transitions. [2019-10-07 13:49:59,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 476 transitions. [2019-10-07 13:49:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-07 13:49:59,103 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:59,104 INFO L385 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-10-07 13:49:59,104 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash 211621434, now seen corresponding path program 1 times [2019-10-07 13:49:59,105 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:59,105 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:59,105 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:59,105 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:59,191 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:59,192 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:59,192 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:49:59,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:49:59,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:49:59,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:49:59,193 INFO L87 Difference]: Start difference. First operand 399 states and 476 transitions. Second operand 6 states. [2019-10-07 13:49:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:59,259 INFO L93 Difference]: Finished difference Result 416 states and 492 transitions. [2019-10-07 13:49:59,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:49:59,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-10-07 13:49:59,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:59,262 INFO L225 Difference]: With dead ends: 416 [2019-10-07 13:49:59,262 INFO L226 Difference]: Without dead ends: 394 [2019-10-07 13:49:59,263 INFO L606 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-10-07 13:49:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-10-07 13:49:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2019-10-07 13:49:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-10-07 13:49:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 470 transitions. [2019-10-07 13:49:59,289 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 470 transitions. Word has length 52 [2019-10-07 13:49:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:59,289 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 470 transitions. [2019-10-07 13:49:59,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:49:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 470 transitions. [2019-10-07 13:49:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:49:59,290 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:59,290 INFO L385 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-10-07 13:49:59,291 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:59,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash -407065973, now seen corresponding path program 1 times [2019-10-07 13:49:59,291 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:59,291 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:59,292 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:59,292 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:59,369 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:59,369 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:59,369 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:59,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:59,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:59,370 INFO L87 Difference]: Start difference. First operand 394 states and 470 transitions. Second operand 9 states. [2019-10-07 13:49:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:59,532 INFO L93 Difference]: Finished difference Result 419 states and 495 transitions. [2019-10-07 13:49:59,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:59,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-07 13:49:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:59,534 INFO L225 Difference]: With dead ends: 419 [2019-10-07 13:49:59,535 INFO L226 Difference]: Without dead ends: 389 [2019-10-07 13:49:59,535 INFO L606 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-10-07 13:49:59,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-10-07 13:49:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2019-10-07 13:49:59,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-10-07 13:49:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 462 transitions. [2019-10-07 13:49:59,564 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 462 transitions. Word has length 51 [2019-10-07 13:49:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:59,565 INFO L462 AbstractCegarLoop]: Abstraction has 389 states and 462 transitions. [2019-10-07 13:49:59,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 462 transitions. [2019-10-07 13:49:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-07 13:49:59,567 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:59,567 INFO L385 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-10-07 13:49:59,567 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2007347647, now seen corresponding path program 1 times [2019-10-07 13:49:59,567 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:59,568 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:59,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:59,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:59,620 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:59,620 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:59,620 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:49:59,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:49:59,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:49:59,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:49:59,621 INFO L87 Difference]: Start difference. First operand 389 states and 462 transitions. Second operand 6 states. [2019-10-07 13:49:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:59,660 INFO L93 Difference]: Finished difference Result 401 states and 474 transitions. [2019-10-07 13:49:59,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:49:59,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-07 13:49:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:59,662 INFO L225 Difference]: With dead ends: 401 [2019-10-07 13:49:59,662 INFO L226 Difference]: Without dead ends: 362 [2019-10-07 13:49:59,663 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-10-07 13:49:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-10-07 13:49:59,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-10-07 13:49:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-07 13:49:59,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 422 transitions. [2019-10-07 13:49:59,687 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 422 transitions. Word has length 53 [2019-10-07 13:49:59,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:59,687 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 422 transitions. [2019-10-07 13:49:59,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:49:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 422 transitions. [2019-10-07 13:49:59,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 13:49:59,688 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:59,688 INFO L385 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-10-07 13:49:59,689 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:59,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:59,689 INFO L82 PathProgramCache]: Analyzing trace with hash -759076076, now seen corresponding path program 1 times [2019-10-07 13:49:59,689 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:59,689 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:59,689 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:59,690 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:59,790 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:59,790 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:59,790 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:59,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:59,792 INFO L87 Difference]: Start difference. First operand 360 states and 422 transitions. Second operand 5 states. [2019-10-07 13:50:00,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:00,119 INFO L93 Difference]: Finished difference Result 613 states and 733 transitions. [2019-10-07 13:50:00,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:50:00,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-10-07 13:50:00,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:00,123 INFO L225 Difference]: With dead ends: 613 [2019-10-07 13:50:00,123 INFO L226 Difference]: Without dead ends: 441 [2019-10-07 13:50:00,124 INFO L606 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-10-07 13:50:00,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-07 13:50:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 410. [2019-10-07 13:50:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-10-07 13:50:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 484 transitions. [2019-10-07 13:50:00,152 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 484 transitions. Word has length 57 [2019-10-07 13:50:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:00,152 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 484 transitions. [2019-10-07 13:50:00,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:50:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 484 transitions. [2019-10-07 13:50:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:50:00,153 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:00,153 INFO L385 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-10-07 13:50:00,154 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1791603402, now seen corresponding path program 1 times [2019-10-07 13:50:00,154 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:00,154 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:00,154 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:00,155 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:00,226 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:00,226 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:00,227 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:50:00,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:50:00,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:50:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:50:00,227 INFO L87 Difference]: Start difference. First operand 410 states and 484 transitions. Second operand 9 states. [2019-10-07 13:50:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:00,399 INFO L93 Difference]: Finished difference Result 435 states and 509 transitions. [2019-10-07 13:50:00,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:50:00,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-07 13:50:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:00,403 INFO L225 Difference]: With dead ends: 435 [2019-10-07 13:50:00,403 INFO L226 Difference]: Without dead ends: 381 [2019-10-07 13:50:00,404 INFO L606 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-10-07 13:50:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-10-07 13:50:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2019-10-07 13:50:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-07 13:50:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 448 transitions. [2019-10-07 13:50:00,438 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 448 transitions. Word has length 54 [2019-10-07 13:50:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:00,438 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 448 transitions. [2019-10-07 13:50:00,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:50:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 448 transitions. [2019-10-07 13:50:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:50:00,439 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:00,439 INFO L385 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-10-07 13:50:00,440 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1794667652, now seen corresponding path program 1 times [2019-10-07 13:50:00,440 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:00,440 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:00,440 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:00,441 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:00,533 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:00,533 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:00,533 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:50:00,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:50:00,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:50:00,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:50:00,535 INFO L87 Difference]: Start difference. First operand 381 states and 448 transitions. Second operand 8 states. [2019-10-07 13:50:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:00,713 INFO L93 Difference]: Finished difference Result 398 states and 465 transitions. [2019-10-07 13:50:00,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:50:00,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-07 13:50:00,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:00,715 INFO L225 Difference]: With dead ends: 398 [2019-10-07 13:50:00,715 INFO L226 Difference]: Without dead ends: 354 [2019-10-07 13:50:00,718 INFO L606 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-10-07 13:50:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-07 13:50:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-10-07 13:50:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-10-07 13:50:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 417 transitions. [2019-10-07 13:50:00,742 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 417 transitions. Word has length 54 [2019-10-07 13:50:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:00,742 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 417 transitions. [2019-10-07 13:50:00,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:50:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 417 transitions. [2019-10-07 13:50:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-07 13:50:00,743 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:00,743 INFO L385 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] [2019-10-07 13:50:00,744 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:00,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:00,744 INFO L82 PathProgramCache]: Analyzing trace with hash -309591851, now seen corresponding path program 1 times [2019-10-07 13:50:00,744 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:00,744 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:00,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:00,745 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:00,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:00,860 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:00,860 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:00,861 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:50:00,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:50:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:50:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:50:00,862 INFO L87 Difference]: Start difference. First operand 354 states and 417 transitions. Second operand 10 states. [2019-10-07 13:50:01,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:01,449 INFO L93 Difference]: Finished difference Result 388 states and 451 transitions. [2019-10-07 13:50:01,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:50:01,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-10-07 13:50:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:01,452 INFO L225 Difference]: With dead ends: 388 [2019-10-07 13:50:01,452 INFO L226 Difference]: Without dead ends: 352 [2019-10-07 13:50:01,453 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:50:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-10-07 13:50:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-10-07 13:50:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-07 13:50:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 412 transitions. [2019-10-07 13:50:01,476 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 412 transitions. Word has length 66 [2019-10-07 13:50:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:01,476 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 412 transitions. [2019-10-07 13:50:01,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:50:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 412 transitions. [2019-10-07 13:50:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-07 13:50:01,477 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:01,478 INFO L385 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-10-07 13:50:01,478 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:01,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash -83778572, now seen corresponding path program 1 times [2019-10-07 13:50:01,478 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:01,478 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:01,479 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:01,479 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:01,590 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:01,590 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:01,590 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:50:01,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:50:01,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:50:01,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:50:01,591 INFO L87 Difference]: Start difference. First operand 352 states and 412 transitions. Second operand 8 states. [2019-10-07 13:50:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:02,114 INFO L93 Difference]: Finished difference Result 434 states and 521 transitions. [2019-10-07 13:50:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:50:02,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-10-07 13:50:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:02,117 INFO L225 Difference]: With dead ends: 434 [2019-10-07 13:50:02,117 INFO L226 Difference]: Without dead ends: 430 [2019-10-07 13:50:02,117 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:50:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-10-07 13:50:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 352. [2019-10-07 13:50:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-07 13:50:02,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 412 transitions. [2019-10-07 13:50:02,143 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 412 transitions. Word has length 67 [2019-10-07 13:50:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:02,143 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 412 transitions. [2019-10-07 13:50:02,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:50:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 412 transitions. [2019-10-07 13:50:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-07 13:50:02,145 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:02,145 INFO L385 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-10-07 13:50:02,145 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash 451436269, now seen corresponding path program 1 times [2019-10-07 13:50:02,145 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:02,146 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:02,146 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:02,146 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:02,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:02,189 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:02,189 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:02,189 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:50:02,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:50:02,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:50:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:50:02,190 INFO L87 Difference]: Start difference. First operand 352 states and 412 transitions. Second operand 5 states. [2019-10-07 13:50:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:02,547 INFO L93 Difference]: Finished difference Result 637 states and 726 transitions. [2019-10-07 13:50:02,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:50:02,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-07 13:50:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:02,550 INFO L225 Difference]: With dead ends: 637 [2019-10-07 13:50:02,550 INFO L226 Difference]: Without dead ends: 418 [2019-10-07 13:50:02,551 INFO L606 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-10-07 13:50:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-07 13:50:02,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 398. [2019-10-07 13:50:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-10-07 13:50:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 456 transitions. [2019-10-07 13:50:02,582 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 456 transitions. Word has length 62 [2019-10-07 13:50:02,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:02,582 INFO L462 AbstractCegarLoop]: Abstraction has 398 states and 456 transitions. [2019-10-07 13:50:02,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:50:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 456 transitions. [2019-10-07 13:50:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-07 13:50:02,584 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:02,584 INFO L385 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-10-07 13:50:02,584 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:02,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:02,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1445775960, now seen corresponding path program 1 times [2019-10-07 13:50:02,585 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:02,585 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:02,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:02,585 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:02,655 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:02,655 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:02,655 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:50:02,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:50:02,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:50:02,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:50:02,656 INFO L87 Difference]: Start difference. First operand 398 states and 456 transitions. Second operand 9 states. [2019-10-07 13:50:02,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:02,802 INFO L93 Difference]: Finished difference Result 400 states and 457 transitions. [2019-10-07 13:50:02,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:50:02,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-07 13:50:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:02,804 INFO L225 Difference]: With dead ends: 400 [2019-10-07 13:50:02,804 INFO L226 Difference]: Without dead ends: 328 [2019-10-07 13:50:02,805 INFO L606 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-10-07 13:50:02,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-10-07 13:50:02,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-10-07 13:50:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-07 13:50:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 380 transitions. [2019-10-07 13:50:02,832 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 380 transitions. Word has length 63 [2019-10-07 13:50:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:02,832 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 380 transitions. [2019-10-07 13:50:02,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:50:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 380 transitions. [2019-10-07 13:50:02,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-07 13:50:02,833 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:02,834 INFO L385 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] [2019-10-07 13:50:02,834 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:02,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:02,834 INFO L82 PathProgramCache]: Analyzing trace with hash 2143981119, now seen corresponding path program 1 times [2019-10-07 13:50:02,834 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:02,835 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:02,835 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:02,835 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:02,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:02,891 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:02,891 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:02,891 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:50:02,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:50:02,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:50:02,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:50:02,892 INFO L87 Difference]: Start difference. First operand 328 states and 380 transitions. Second operand 7 states. [2019-10-07 13:50:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:02,983 INFO L93 Difference]: Finished difference Result 345 states and 396 transitions. [2019-10-07 13:50:02,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:50:02,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-10-07 13:50:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:02,985 INFO L225 Difference]: With dead ends: 345 [2019-10-07 13:50:02,985 INFO L226 Difference]: Without dead ends: 326 [2019-10-07 13:50:02,986 INFO L606 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-10-07 13:50:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-07 13:50:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2019-10-07 13:50:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-07 13:50:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 328 transitions. [2019-10-07 13:50:03,017 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 328 transitions. Word has length 74 [2019-10-07 13:50:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:03,017 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 328 transitions. [2019-10-07 13:50:03,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:50:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 328 transitions. [2019-10-07 13:50:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-07 13:50:03,019 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:03,019 INFO L385 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] [2019-10-07 13:50:03,019 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:03,020 INFO L82 PathProgramCache]: Analyzing trace with hash -123615300, now seen corresponding path program 1 times [2019-10-07 13:50:03,020 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:03,020 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:03,020 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:03,021 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:03,142 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:03,143 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:03,143 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:50:03,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:50:03,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:50:03,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:50:03,144 INFO L87 Difference]: Start difference. First operand 287 states and 328 transitions. Second operand 10 states. [2019-10-07 13:50:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:03,558 INFO L93 Difference]: Finished difference Result 403 states and 457 transitions. [2019-10-07 13:50:03,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:50:03,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-10-07 13:50:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:03,560 INFO L225 Difference]: With dead ends: 403 [2019-10-07 13:50:03,560 INFO L226 Difference]: Without dead ends: 259 [2019-10-07 13:50:03,561 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:50:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-07 13:50:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2019-10-07 13:50:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-07 13:50:03,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 289 transitions. [2019-10-07 13:50:03,581 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 289 transitions. Word has length 75 [2019-10-07 13:50:03,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:03,582 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 289 transitions. [2019-10-07 13:50:03,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:50:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 289 transitions. [2019-10-07 13:50:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-07 13:50:03,583 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:03,583 INFO L385 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] [2019-10-07 13:50:03,584 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:03,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:03,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1138474364, now seen corresponding path program 1 times [2019-10-07 13:50:03,584 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:03,584 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:03,584 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:03,584 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:03,670 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:03,671 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:03,671 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:50:03,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:50:03,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:50:03,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:50:03,672 INFO L87 Difference]: Start difference. First operand 255 states and 289 transitions. Second operand 10 states. [2019-10-07 13:50:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:03,892 INFO L93 Difference]: Finished difference Result 297 states and 328 transitions. [2019-10-07 13:50:03,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:50:03,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-10-07 13:50:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:03,893 INFO L225 Difference]: With dead ends: 297 [2019-10-07 13:50:03,894 INFO L226 Difference]: Without dead ends: 235 [2019-10-07 13:50:03,894 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-10-07 13:50:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-07 13:50:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2019-10-07 13:50:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-07 13:50:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 265 transitions. [2019-10-07 13:50:03,915 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 265 transitions. Word has length 81 [2019-10-07 13:50:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:03,915 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 265 transitions. [2019-10-07 13:50:03,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:50:03,915 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 265 transitions. [2019-10-07 13:50:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-07 13:50:03,916 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:03,916 INFO L385 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] [2019-10-07 13:50:03,917 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:03,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:03,917 INFO L82 PathProgramCache]: Analyzing trace with hash 775720589, now seen corresponding path program 1 times [2019-10-07 13:50:03,917 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:03,917 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:03,918 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:03,918 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:50:04,027 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:04,027 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:04,027 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:50:04,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:50:04,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:50:04,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:50:04,029 INFO L87 Difference]: Start difference. First operand 235 states and 265 transitions. Second operand 11 states. [2019-10-07 13:50:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:04,143 INFO L93 Difference]: Finished difference Result 313 states and 350 transitions. [2019-10-07 13:50:04,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:50:04,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-10-07 13:50:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:04,146 INFO L225 Difference]: With dead ends: 313 [2019-10-07 13:50:04,146 INFO L226 Difference]: Without dead ends: 200 [2019-10-07 13:50:04,147 INFO L606 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-10-07 13:50:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-07 13:50:04,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2019-10-07 13:50:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-10-07 13:50:04,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2019-10-07 13:50:04,169 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 86 [2019-10-07 13:50:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:04,169 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2019-10-07 13:50:04,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:50:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2019-10-07 13:50:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-07 13:50:04,171 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:04,171 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:50:04,171 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:04,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1293847127, now seen corresponding path program 1 times [2019-10-07 13:50:04,172 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:04,172 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:04,172 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:04,172 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:04,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-07 13:50:04,319 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:04,319 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:04,319 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:50:04,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:50:04,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:50:04,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:50:04,320 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand 7 states. [2019-10-07 13:50:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:04,480 INFO L93 Difference]: Finished difference Result 251 states and 282 transitions. [2019-10-07 13:50:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:50:04,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-10-07 13:50:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:04,482 INFO L225 Difference]: With dead ends: 251 [2019-10-07 13:50:04,482 INFO L226 Difference]: Without dead ends: 248 [2019-10-07 13:50:04,482 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:50:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-07 13:50:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 226. [2019-10-07 13:50:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-07 13:50:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 252 transitions. [2019-10-07 13:50:04,502 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 252 transitions. Word has length 91 [2019-10-07 13:50:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:04,503 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 252 transitions. [2019-10-07 13:50:04,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:50:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 252 transitions. [2019-10-07 13:50:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-07 13:50:04,504 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:04,504 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:50:04,504 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash 2073576186, now seen corresponding path program 1 times [2019-10-07 13:50:04,505 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:04,505 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:04,505 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:04,505 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:04,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 13:50:04,562 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:04,563 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:04,563 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:50:04,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:50:04,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:50:04,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:50:04,564 INFO L87 Difference]: Start difference. First operand 226 states and 252 transitions. Second operand 5 states. [2019-10-07 13:50:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:04,747 INFO L93 Difference]: Finished difference Result 307 states and 337 transitions. [2019-10-07 13:50:04,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:50:04,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-10-07 13:50:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:04,755 INFO L225 Difference]: With dead ends: 307 [2019-10-07 13:50:04,755 INFO L226 Difference]: Without dead ends: 246 [2019-10-07 13:50:04,756 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-07 13:50:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-07 13:50:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 151. [2019-10-07 13:50:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-07 13:50:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2019-10-07 13:50:04,772 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 99 [2019-10-07 13:50:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:04,772 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2019-10-07 13:50:04,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:50:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2019-10-07 13:50:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-07 13:50:04,773 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:04,773 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:50:04,774 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:04,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:04,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1183994184, now seen corresponding path program 1 times [2019-10-07 13:50:04,774 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:04,775 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:04,775 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:04,775 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:04,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 13:50:04,895 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:04,895 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:04,895 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:50:04,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:50:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:50:04,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:50:04,896 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 13 states. [2019-10-07 13:50:05,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:05,113 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2019-10-07 13:50:05,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:50:05,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110 [2019-10-07 13:50:05,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:05,115 INFO L225 Difference]: With dead ends: 194 [2019-10-07 13:50:05,115 INFO L226 Difference]: Without dead ends: 165 [2019-10-07 13:50:05,115 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-10-07 13:50:05,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-07 13:50:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-10-07 13:50:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-07 13:50:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 170 transitions. [2019-10-07 13:50:05,130 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 170 transitions. Word has length 110 [2019-10-07 13:50:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:05,130 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 170 transitions. [2019-10-07 13:50:05,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:50:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 170 transitions. [2019-10-07 13:50:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-07 13:50:05,131 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:05,132 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:50:05,132 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:05,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:05,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1713752837, now seen corresponding path program 1 times [2019-10-07 13:50:05,132 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:05,132 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:05,133 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:05,133 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 13:50:05,244 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:05,244 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:05,244 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:50:05,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:50:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:50:05,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:50:05,245 INFO L87 Difference]: Start difference. First operand 161 states and 170 transitions. Second operand 11 states. [2019-10-07 13:50:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:05,367 INFO L93 Difference]: Finished difference Result 190 states and 202 transitions. [2019-10-07 13:50:05,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:50:05,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2019-10-07 13:50:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:05,369 INFO L225 Difference]: With dead ends: 190 [2019-10-07 13:50:05,370 INFO L226 Difference]: Without dead ends: 157 [2019-10-07 13:50:05,372 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-07 13:50:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-10-07 13:50:05,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-10-07 13:50:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-07 13:50:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2019-10-07 13:50:05,391 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 123 [2019-10-07 13:50:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:05,392 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2019-10-07 13:50:05,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:50:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2019-10-07 13:50:05,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-07 13:50:05,394 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:05,394 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:50:05,395 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:05,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1253619711, now seen corresponding path program 1 times [2019-10-07 13:50:05,395 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:05,395 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:05,396 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:05,396 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:05,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 13:50:05,490 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:05,490 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:05,490 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:50:05,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:50:05,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:50:05,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:50:05,491 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand 5 states. [2019-10-07 13:50:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:05,587 INFO L93 Difference]: Finished difference Result 196 states and 203 transitions. [2019-10-07 13:50:05,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:50:05,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2019-10-07 13:50:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:05,589 INFO L225 Difference]: With dead ends: 196 [2019-10-07 13:50:05,589 INFO L226 Difference]: Without dead ends: 142 [2019-10-07 13:50:05,591 INFO L606 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-10-07 13:50:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-07 13:50:05,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-10-07 13:50:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-07 13:50:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-10-07 13:50:05,607 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 126 [2019-10-07 13:50:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:05,607 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-10-07 13:50:05,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:50:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-10-07 13:50:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-07 13:50:05,608 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:50:05,609 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 13:50:05,609 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:50:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:50:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash 120929572, now seen corresponding path program 1 times [2019-10-07 13:50:05,610 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:50:05,610 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:05,610 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:05,610 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:50:05,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:50:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:50:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-07 13:50:05,911 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:50:05,911 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:50:05,911 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:50:05,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:50:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:50:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:50:05,912 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 14 states. [2019-10-07 13:50:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:50:06,795 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2019-10-07 13:50:06,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 13:50:06,796 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 128 [2019-10-07 13:50:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:50:06,796 INFO L225 Difference]: With dead ends: 145 [2019-10-07 13:50:06,797 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:50:06,797 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2019-10-07 13:50:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:50:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:50:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:50:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:50:06,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2019-10-07 13:50:06,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:50:06,799 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:50:06,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:50:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:50:06,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:50:06,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:50:08,343 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-07 13:50:08,600 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 68 [2019-10-07 13:50:08,758 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 64 [2019-10-07 13:50:08,866 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-10-07 13:50:09,032 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-10-07 13:50:09,243 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-10-07 13:50:09,775 WARN L191 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 91 [2019-10-07 13:50:09,912 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 67 [2019-10-07 13:50:10,175 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2019-10-07 13:50:10,529 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 74 [2019-10-07 13:50:11,196 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 56 [2019-10-07 13:50:11,713 WARN L191 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 90 [2019-10-07 13:50:11,921 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2019-10-07 13:50:12,556 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 93 [2019-10-07 13:50:12,871 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 1 [2019-10-07 13:50:12,999 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-07 13:50:13,271 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2019-10-07 13:50:13,393 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-07 13:50:14,029 WARN L191 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 93 [2019-10-07 13:50:14,306 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 72 [2019-10-07 13:50:14,425 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-07 13:50:14,830 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2019-10-07 13:50:15,005 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2019-10-07 13:50:15,376 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2019-10-07 13:50:15,585 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2019-10-07 13:50:16,138 WARN L191 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2019-10-07 13:50:16,274 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-10-07 13:50:16,777 WARN L191 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 74 [2019-10-07 13:50:16,893 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-07 13:50:17,427 WARN L191 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 91 [2019-10-07 13:50:17,782 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 68 [2019-10-07 13:50:17,984 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-10-07 13:50:18,170 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-10-07 13:50:18,335 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-10-07 13:50:18,850 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 92 [2019-10-07 13:50:19,184 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2019-10-07 13:50:19,298 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-07 13:50:19,911 WARN L191 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 96 [2019-10-07 13:50:20,062 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-10-07 13:50:20,303 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 84 [2019-10-07 13:50:21,188 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 94 [2019-10-07 13:50:21,378 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-10-07 13:50:21,575 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-10-07 13:50:21,676 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-07 13:50:21,866 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2019-10-07 13:50:21,974 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-10-07 13:50:22,576 WARN L191 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 86 [2019-10-07 13:50:22,740 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2019-10-07 13:50:23,011 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 72 [2019-10-07 13:50:23,247 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 61 [2019-10-07 13:50:23,415 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2019-10-07 13:50:23,942 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2019-10-07 13:50:24,277 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-10-07 13:50:24,426 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-10-07 13:50:24,661 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 69 [2019-10-07 13:50:24,842 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2019-10-07 13:50:25,083 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-10-07 13:50:25,219 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-10-07 13:50:25,357 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-10-07 13:50:25,510 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2019-10-07 13:50:25,742 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-10-07 13:50:26,032 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 71 [2019-10-07 13:50:26,531 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 75 [2019-10-07 13:50:26,884 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2019-10-07 13:50:27,687 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 95 [2019-10-07 13:50:27,880 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 1 [2019-10-07 13:50:28,200 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 73 [2019-10-07 13:50:28,435 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-07 13:50:28,693 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-10-07 13:50:28,856 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-10-07 13:50:29,039 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2019-10-07 13:50:29,179 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2019-10-07 13:50:29,453 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2019-10-07 13:50:29,515 INFO L443 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 908 929) no Hoare annotation was computed. [2019-10-07 13:50:29,516 INFO L446 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 908 929) the Hoare annotation is: true [2019-10-07 13:50:29,516 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 66 86) the Hoare annotation is: (or (not (= ~myStatus~0 0)) (not (<= ~MaximumInterfaceType~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~s~0 ~MPR1~0) (= ~s~0 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~s~0 ~DC~0) (= ~s~0 ~SKIP2~0) (= ~MPR3~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,517 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 66 86) no Hoare annotation was computed. [2019-10-07 13:50:29,517 INFO L443 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 930 950) no Hoare annotation was computed. [2019-10-07 13:50:29,517 INFO L446 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 930 950) the Hoare annotation is: true [2019-10-07 13:50:29,517 INFO L443 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 646 652) no Hoare annotation was computed. [2019-10-07 13:50:29,517 INFO L443 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsENTRY(lines 646 652) no Hoare annotation was computed. [2019-10-07 13:50:29,518 INFO L439 ceAbstractionStarter]: At program point L341(line 341) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~myStatus~0 0) (= 0 ~pended~0) (= FloppyPnp_~__cil_tmp30~0 259) (<= 1 ~compRegistered~0) (= FloppyPnp_~__cil_tmp30~0 FloppyPnp_~ntStatus~0) (= ~MPR3~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,518 INFO L443 ceAbstractionStarter]: For program point L341-1(line 341) no Hoare annotation was computed. [2019-10-07 13:50:29,518 INFO L443 ceAbstractionStarter]: For program point L209(lines 209 424) no Hoare annotation was computed. [2019-10-07 13:50:29,518 INFO L443 ceAbstractionStarter]: For program point L300(lines 300 306) no Hoare annotation was computed. [2019-10-07 13:50:29,518 INFO L439 ceAbstractionStarter]: At program point L325(line 325) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,518 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 290) no Hoare annotation was computed. [2019-10-07 13:50:29,518 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 421) no Hoare annotation was computed. [2019-10-07 13:50:29,519 INFO L439 ceAbstractionStarter]: At program point L408(line 408) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,519 INFO L443 ceAbstractionStarter]: For program point L408-1(lines 404 410) no Hoare annotation was computed. [2019-10-07 13:50:29,519 INFO L439 ceAbstractionStarter]: At program point L243(line 243) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,519 INFO L443 ceAbstractionStarter]: For program point L243-1(lines 239 245) no Hoare annotation was computed. [2019-10-07 13:50:29,520 INFO L439 ceAbstractionStarter]: At program point L202(line 202) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (and (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,520 INFO L443 ceAbstractionStarter]: For program point L235-1(lines 228 416) no Hoare annotation was computed. [2019-10-07 13:50:29,520 INFO L443 ceAbstractionStarter]: For program point L202-1(line 202) no Hoare annotation was computed. [2019-10-07 13:50:29,520 INFO L439 ceAbstractionStarter]: At program point L392(lines 392 393) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 (<= (+ ~IPC~0 ~SKIP1~0) (+ ~s~0 |old(~s~0)|))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse1 .cse2 (= ~s~0 ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:50:29,520 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 365) no Hoare annotation was computed. [2019-10-07 13:50:29,520 INFO L443 ceAbstractionStarter]: For program point L392-1(lines 392 393) no Hoare annotation was computed. [2019-10-07 13:50:29,521 INFO L439 ceAbstractionStarter]: At program point L227(lines 226 419) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,521 INFO L439 ceAbstractionStarter]: At program point L417(lines 228 418) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~IPC~0)) (.cse4 (= 1 ~pended~0)) (.cse5 (= 0 ~compRegistered~0)) (.cse6 (= ~s~0 ~DC~0)) (.cse7 (= ~s~0 ~SKIP2~0)) (.cse1 (= 0 ~pended~0)) (.cse2 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse3 (<= ~compRegistered~0 0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and .cse0 .cse1 .cse2 (<= (+ ~IPC~0 ~SKIP1~0) (+ ~s~0 |old(~s~0)|)) .cse3) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (and .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse5) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and .cse4 .cse7 .cse5) (not (= |old(~compRegistered~0)| 0)) (and (and .cse1 .cse6) (not (= 259 FloppyPnp_~ntStatus~0))) (not (<= 1 ~NP~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= ~NP~0 1)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= 0 |old(~pended~0)|)) (and .cse7 .cse1 .cse2 .cse3) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:50:29,521 INFO L439 ceAbstractionStarter]: At program point L351(line 351) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse2 (= 1 ~s~0)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse3 (and .cse0 (= 0 ~pended~0) .cse1 (<= 1 ~compRegistered~0)))) (or (not .cse0) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not .cse1) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (and (and .cse2 .cse3 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (= FloppyPnp_~__cil_tmp30~0 FloppyPnp_~ntStatus~0) (not (= FloppyPnp_~__cil_tmp30~0 259)) .cse4) (and (not (= ~myStatus~0 259)) (not (= 259 FloppyPnp_~ntStatus~0)) .cse2 .cse4 .cse3) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:50:29,521 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 330) no Hoare annotation was computed. [2019-10-07 13:50:29,522 INFO L439 ceAbstractionStarter]: At program point L219(lines 215 422) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (and (not (= ~myStatus~0 259)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= 259 FloppyPnp_~ntStatus~0)) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,522 INFO L443 ceAbstractionStarter]: For program point L376(lines 376 382) no Hoare annotation was computed. [2019-10-07 13:50:29,522 INFO L439 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,522 INFO L443 ceAbstractionStarter]: For program point L310-1(line 310) no Hoare annotation was computed. [2019-10-07 13:50:29,522 INFO L439 ceAbstractionStarter]: At program point L335(line 335) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= ~myStatus~0 0) (= 0 ~pended~0) (not (= 259 FloppyPnp_~ntStatus~0)) (<= 1 ~compRegistered~0) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,523 INFO L443 ceAbstractionStarter]: For program point L335-1(line 335) no Hoare annotation was computed. [2019-10-07 13:50:29,523 INFO L439 ceAbstractionStarter]: At program point L261(lines 261 262) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (and (= 1 ~pended~0) .cse0 (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) .cse0 (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:50:29,523 INFO L443 ceAbstractionStarter]: For program point L294-1(lines 228 416) no Hoare annotation was computed. [2019-10-07 13:50:29,523 INFO L443 ceAbstractionStarter]: For program point L261-1(lines 261 262) no Hoare annotation was computed. [2019-10-07 13:50:29,523 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 423) no Hoare annotation was computed. [2019-10-07 13:50:29,523 INFO L439 ceAbstractionStarter]: At program point L369(line 369) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,523 INFO L443 ceAbstractionStarter]: For program point L369-1(line 369) no Hoare annotation was computed. [2019-10-07 13:50:29,524 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 276) no Hoare annotation was computed. [2019-10-07 13:50:29,524 INFO L439 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,524 INFO L439 ceAbstractionStarter]: At program point L221(lines 221 420) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,524 INFO L439 ceAbstractionStarter]: At program point L213(lines 209 424) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,524 INFO L439 ceAbstractionStarter]: At program point L304(line 304) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,525 INFO L443 ceAbstractionStarter]: For program point L304-1(lines 300 306) no Hoare annotation was computed. [2019-10-07 13:50:29,525 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 205) no Hoare annotation was computed. [2019-10-07 13:50:29,525 INFO L439 ceAbstractionStarter]: At program point L288(line 288) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0))) (or (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~pended~0) .cse0 (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 1 ~pended~0) (= ~s~0 ~NP~0) .cse0) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:50:29,525 INFO L439 ceAbstractionStarter]: At program point L255(line 255) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,525 INFO L443 ceAbstractionStarter]: For program point L255-1(line 255) no Hoare annotation was computed. [2019-10-07 13:50:29,526 INFO L439 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse0 (= 0 ~compRegistered~0)) (.cse1 (= ~SKIP1~0 ~s~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (and (= 1 ~pended~0) .cse0 .cse1) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) .cse0 (= |old(~customIrp~0)| ~customIrp~0) .cse1) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:50:29,526 INFO L443 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2019-10-07 13:50:29,526 INFO L443 ceAbstractionStarter]: For program point L239(lines 239 245) no Hoare annotation was computed. [2019-10-07 13:50:29,526 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 425) no Hoare annotation was computed. [2019-10-07 13:50:29,526 INFO L439 ceAbstractionStarter]: At program point L363(line 363) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,526 INFO L443 ceAbstractionStarter]: For program point L396-1(lines 396 400) no Hoare annotation was computed. [2019-10-07 13:50:29,526 INFO L443 ceAbstractionStarter]: For program point L363-1(lines 359 365) no Hoare annotation was computed. [2019-10-07 13:50:29,526 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-10-07 13:50:29,527 INFO L439 ceAbstractionStarter]: At program point L388(line 388) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,527 INFO L443 ceAbstractionStarter]: For program point L388-1(line 388) no Hoare annotation was computed. [2019-10-07 13:50:29,527 INFO L443 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 159 432) no Hoare annotation was computed. [2019-10-07 13:50:29,527 INFO L439 ceAbstractionStarter]: At program point L380(line 380) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,527 INFO L443 ceAbstractionStarter]: For program point L380-1(lines 376 382) no Hoare annotation was computed. [2019-10-07 13:50:29,527 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 422) no Hoare annotation was computed. [2019-10-07 13:50:29,527 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 344) no Hoare annotation was computed. [2019-10-07 13:50:29,528 INFO L443 ceAbstractionStarter]: For program point L339-2(lines 339 344) no Hoare annotation was computed. [2019-10-07 13:50:29,528 INFO L439 ceAbstractionStarter]: At program point L207(lines 206 425) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 FloppyPnp_~ntStatus~0) (= 1 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,528 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 329) no Hoare annotation was computed. [2019-10-07 13:50:29,528 INFO L443 ceAbstractionStarter]: For program point L323-1(lines 318 330) no Hoare annotation was computed. [2019-10-07 13:50:29,528 INFO L439 ceAbstractionStarter]: At program point L224(lines 224 419) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,528 INFO L439 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,529 INFO L443 ceAbstractionStarter]: For program point L414-1(line 414) no Hoare annotation was computed. [2019-10-07 13:50:29,529 INFO L439 ceAbstractionStarter]: At program point L249(line 249) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,529 INFO L443 ceAbstractionStarter]: For program point L249-1(line 249) no Hoare annotation was computed. [2019-10-07 13:50:29,529 INFO L439 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,529 INFO L443 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 159 432) no Hoare annotation was computed. [2019-10-07 13:50:29,529 INFO L443 ceAbstractionStarter]: For program point L274-1(lines 270 276) no Hoare annotation was computed. [2019-10-07 13:50:29,530 INFO L439 ceAbstractionStarter]: At program point L398(line 398) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= 0 ~compRegistered~0)) (.cse2 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (and (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 (<= (+ ~IPC~0 ~SKIP1~0) (+ ~s~0 |old(~s~0)|))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (and .cse0 .cse1 .cse2 (= ~s~0 ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:50:29,530 INFO L443 ceAbstractionStarter]: For program point L398-1(line 398) no Hoare annotation was computed. [2019-10-07 13:50:29,530 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 395) no Hoare annotation was computed. [2019-10-07 13:50:29,530 INFO L443 ceAbstractionStarter]: For program point L390-2(lines 228 416) no Hoare annotation was computed. [2019-10-07 13:50:29,530 INFO L439 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 159 432) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,530 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(~MPR1~0)|)) (and (= main_~status~1 ~lowerDriverReturn~0) (= ~s~0 ~MPR1~0) (= ~myStatus~0 0) (= 0 ~pended~0) (= 0 ~compRegistered~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) (= main_~status~1 0) (= ~MPR3~0 ~s~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,530 INFO L443 ceAbstractionStarter]: For program point L704-1(lines 700 837) no Hoare annotation was computed. [2019-10-07 13:50:29,531 INFO L443 ceAbstractionStarter]: For program point L795(lines 779 834) no Hoare annotation was computed. [2019-10-07 13:50:29,531 INFO L443 ceAbstractionStarter]: For program point L729(lines 729 777) no Hoare annotation was computed. [2019-10-07 13:50:29,531 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 666 838) no Hoare annotation was computed. [2019-10-07 13:50:29,531 INFO L443 ceAbstractionStarter]: For program point L796(lines 796 831) no Hoare annotation was computed. [2019-10-07 13:50:29,531 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(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,531 INFO L443 ceAbstractionStarter]: For program point L788(lines 788 792) no Hoare annotation was computed. [2019-10-07 13:50:29,531 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 784) no Hoare annotation was computed. [2019-10-07 13:50:29,531 INFO L443 ceAbstractionStarter]: For program point L739(lines 739 775) no Hoare annotation was computed. [2019-10-07 13:50:29,532 INFO L439 ceAbstractionStarter]: At program point L706(lines 700 837) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse12 (= 0 ~pended~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= ~s~0 ~DC~0))) (let ((.cse10 (= ~s~0 ~SKIP2~0)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= main_~status~1 ~lowerDriverReturn~0)) (.cse6 (= ~s~0 ~IPC~0)) (.cse7 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse13 (<= ~compRegistered~0 0)) (.cse0 (= 1 ~pended~0)) (.cse3 (= 0 ~compRegistered~0)) (.cse9 (and .cse1 .cse2 .cse12 .cse4 .cse5))) (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)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse4) (and (or (<= main_~status~1 258) (<= 260 main_~status~1)) .cse7 .cse8 .cse9) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse7 .cse4 .cse8) (not (= |old(~compRegistered~0)| 0)) (and .cse11 .cse10 .cse1 .cse2 .cse12 .cse7 .cse4 .cse8 .cse13) (and .cse11 .cse6 .cse2 .cse12 .cse7 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse13) (and .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) .cse12 .cse5) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse9 (<= (+ main_~status~1 1073741738) 0)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:50:29,532 INFO L443 ceAbstractionStarter]: For program point L797(lines 797 830) no Hoare annotation was computed. [2019-10-07 13:50:29,532 INFO L443 ceAbstractionStarter]: For program point L756(line 756) no Hoare annotation was computed. [2019-10-07 13:50:29,532 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 666 838) no Hoare annotation was computed. [2019-10-07 13:50:29,532 INFO L439 ceAbstractionStarter]: At program point L715-2(lines 715 718) 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(~MPR1~0)|)) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= ~s~0 ~NP~0) (= main_~status~1 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1) (= 1 ~s~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= |old(~customIrp~0)| ~customIrp~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,533 INFO L439 ceAbstractionStarter]: At program point L740(lines 739 775) 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(~MPR1~0)|)) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= ~s~0 ~NP~0) (= main_~status~1 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1) (= 1 ~s~0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,533 INFO L443 ceAbstractionStarter]: For program point L798(lines 798 808) no Hoare annotation was computed. [2019-10-07 13:50:29,533 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 666 838) 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(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~s~0 ~MPR1~0) (= ~s~0 ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~s~0 ~DC~0) (= ~s~0 ~SKIP2~0) (= ~MPR3~0 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (<= ~MaximumInterfaceType~0 0) (= ~SKIP1~0 ~s~0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,533 INFO L443 ceAbstractionStarter]: For program point L823(lines 823 827) no Hoare annotation was computed. [2019-10-07 13:50:29,533 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 805) no Hoare annotation was computed. [2019-10-07 13:50:29,533 INFO L443 ceAbstractionStarter]: For program point L766(line 766) no Hoare annotation was computed. [2019-10-07 13:50:29,533 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 828) no Hoare annotation was computed. [2019-10-07 13:50:29,533 INFO L443 ceAbstractionStarter]: For program point L734(lines 734 776) no Hoare annotation was computed. [2019-10-07 13:50:29,534 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(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,534 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 821) no Hoare annotation was computed. [2019-10-07 13:50:29,534 INFO L443 ceAbstractionStarter]: For program point L751(line 751) no Hoare annotation was computed. [2019-10-07 13:50:29,534 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(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,534 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(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,534 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)) (.cse2 (= ~s~0 ~DC~0))) (let ((.cse5 (and .cse6 .cse7 .cse8 .cse2))) (let ((.cse0 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse1 (or (and (= main_~status~1 ~lowerDriverReturn~0) .cse6 .cse7 .cse8 (<= ~compRegistered~0 0)) .cse5))) (let ((.cse3 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse4 (and .cse0 .cse1))) (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)|)) (and .cse0 (<= (+ ~DC~0 7) ~s~0) .cse1) (and (= main_~status~1 0) .cse2) (not (= |old(~compRegistered~0)| 0)) (and (<= ~SKIP2~0 ~s~0) (and .cse3 .cse4)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= (+ main_~status~1 1073741738) 0) .cse5) (and (or (<= main_~status~1 258) (<= 260 main_~status~1)) .cse3 .cse4) (and (= 1 ~pended~0) .cse6 .cse7 .cse8) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))))) [2019-10-07 13:50:29,535 INFO L439 ceAbstractionStarter]: At program point L744(lines 744 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(~MPR1~0)|)) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= ~s~0 ~NP~0) (= main_~status~1 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1) (= 1 ~s~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= |old(~customIrp~0)| ~customIrp~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,535 INFO L439 ceAbstractionStarter]: At program point L794(lines 787 833) the Hoare annotation is: (let ((.cse11 (<= (+ ~DC~0 5) ~IPC~0)) (.cse7 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse8 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= ~s~0 ~DC~0))) (let ((.cse5 (= main_~status~1 ~lowerDriverReturn~0)) (.cse10 (= ~s~0 ~SKIP2~0)) (.cse0 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (and .cse11 .cse7 .cse8 .cse4)) (.cse6 (= ~s~0 ~IPC~0)) (.cse3 (= 1 ~pended~0)) (.cse9 (<= ~compRegistered~0 0))) (or (and (or (<= main_~status~1 258) (<= 260 main_~status~1)) .cse0 .cse1 .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 .cse3 .cse2) (not (= |old(~s~0)| |old(~DC~0)|)) (and (= main_~status~1 0) .cse4) (not (= |old(~compRegistered~0)| 0)) (and .cse5 .cse6 .cse7 .cse0 .cse8 (<= (+ ~DC~0 7) ~s~0) .cse9) (and .cse5 .cse10 .cse11 .cse7 .cse0 .cse8 .cse1 .cse9) (and .cse3 .cse10 .cse11 .cse7 .cse0 .cse8 .cse1 .cse9) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= (+ main_~status~1 1073741738) 0) .cse2) (and .cse6 .cse3 .cse11 .cse7 .cse8 .cse9) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:50:29,535 INFO L443 ceAbstractionStarter]: For program point L761(line 761) no Hoare annotation was computed. [2019-10-07 13:50:29,535 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(~MPR1~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,536 INFO L439 ceAbstractionStarter]: At program point L786(lines 779 834) the Hoare annotation is: (let ((.cse3 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse11 (= 0 ~pended~0)) (.cse6 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse8 (= ~s~0 ~DC~0))) (let ((.cse0 (= 1 ~pended~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse9 (= ~s~0 ~IPC~0)) (.cse10 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (= ~s~0 ~SKIP2~0)) (.cse12 (<= ~compRegistered~0 0)) (.cse5 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse13 (and .cse3 .cse2 .cse11 .cse6 .cse8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (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 .cse3 .cse2 .cse4 .cse6 .cse8) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse6) (not (= |old(~compRegistered~0)| 0)) (and .cse10 .cse9 .cse2 .cse11 .cse5 .cse6 (<= (+ ~DC~0 7) ~s~0) .cse12) (and .cse10 .cse1 .cse3 .cse2 .cse11 .cse5 .cse6 .cse7 .cse12) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (or (<= main_~status~1 258) (<= 260 main_~status~1)) .cse5 .cse13 .cse7) (and (= main_~status~1 0) .cse11 .cse8) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (and .cse13 (<= (+ main_~status~1 1073741738) 0)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:50:29,536 INFO L443 ceAbstractionStarter]: For program point L720(lines 706 778) no Hoare annotation was computed. [2019-10-07 13:50:29,536 INFO L439 ceAbstractionStarter]: At program point L745(lines 744 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(~MPR1~0)|)) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= ~s~0 ~NP~0) (= main_~status~1 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= ~NP~0 1) (= 1 ~s~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= |old(~customIrp~0)| ~customIrp~0) (<= ~MaximumInterfaceType~0 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,536 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-10-07 13:50:29,536 INFO L443 ceAbstractionStarter]: For program point L1176-1(line 1176) no Hoare annotation was computed. [2019-10-07 13:50:29,537 INFO L443 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1167 1180) no Hoare annotation was computed. [2019-10-07 13:50:29,537 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-10-07 13:50:29,537 INFO L439 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse4 (not (= ~myStatus~0 0)))) (let ((.cse0 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and .cse4 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse1 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 1 ~setEventCalled~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= ~setEventCalled~0 1)))) (.cse3 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 (not (= ~customIrp~0 1)) .cse0 .cse2) (or .cse4 .cse1 .cse3)))) [2019-10-07 13:50:29,537 INFO L443 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2019-10-07 13:50:29,537 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 951 964) the Hoare annotation is: (let ((.cse5 (not (= ~myStatus~0 0)))) (let ((.cse0 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and .cse5 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse4 (= ~s~0 |old(~s~0)|)) (.cse1 (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= 1 ~setEventCalled~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (<= ~setEventCalled~0 1)))) (.cse3 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse1 .cse4 (not (= ~customIrp~0 1)) .cse0 .cse2) (or .cse4 .cse5 .cse1 .cse3)))) [2019-10-07 13:50:29,537 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 951 964) no Hoare annotation was computed. [2019-10-07 13:50:29,538 INFO L446 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: true [2019-10-07 13:50:29,538 INFO L443 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2019-10-07 13:50:29,538 INFO L446 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 601 610) the Hoare annotation is: true [2019-10-07 13:50:29,538 INFO L443 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 601 610) no Hoare annotation was computed. [2019-10-07 13:50:29,538 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1060 1101) no Hoare annotation was computed. [2019-10-07 13:50:29,538 INFO L439 ceAbstractionStarter]: At program point L1080(line 1080) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse8 (not (= 0 ~pended~0))) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse12 (not (= ~myStatus~0 0)))) (let ((.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse4 (not (= ~compRegistered~0 0))) (.cse14 (not (= |old(~s~0)| ~MPR3~0))) (.cse9 (not (= |old(~customIrp~0)| 0))) (.cse11 (not (<= 1 ~NP~0))) (.cse17 (not (<= ~MaximumInterfaceType~0 0))) (.cse7 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse15 (not (<= ~NP~0 1))) (.cse18 (and .cse12 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse10 (not (<= 1 |old(~setEventCalled~0)|))) (.cse3 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse13 (or .cse0 .cse8 (not (<= 1 ~compRegistered~0)) .cse5 .cse6)) (.cse16 (not (<= |old(~setEventCalled~0)| 1)))) (and (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse5 (not (= 1 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse8 .cse6 .cse9) (or .cse2 .cse10 .cse11 .cse3 .cse12 .cse7 .cse13 .cse14 .cse15 .cse9 .cse16) (or .cse11 .cse17 .cse7 .cse15 .cse18 .cse2 .cse10 .cse3 .cse13 .cse14 .cse9 .cse16) (or .cse11 .cse17 .cse7 .cse15 .cse18 (not (= |old(~customIrp~0)| 1)) .cse2 .cse10 .cse3 .cse13 .cse16)))) [2019-10-07 13:50:29,539 INFO L443 ceAbstractionStarter]: For program point L1078(lines 1078 1082) no Hoare annotation was computed. [2019-10-07 13:50:29,539 INFO L439 ceAbstractionStarter]: At program point L1078-1(lines 1065 1084) the Hoare annotation is: (let ((.cse13 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse17 (not (= 0 ~pended~0))) (.cse14 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse18 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse19 (= 1 ~s~0)) (.cse20 (not (= ~myStatus~0 0)))) (let ((.cse15 (not (= |old(~s~0)| ~NP~0))) (.cse16 (not (= ~compRegistered~0 0))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse5 (and .cse20 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse1 (not (<= 1 ~NP~0))) (.cse3 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse4 (not (<= ~NP~0 1))) (.cse0 (and .cse19 (= |old(~customIrp~0)| ~customIrp~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= 1 |old(~setEventCalled~0)|))) (.cse8 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse9 (or .cse13 .cse17 (not (<= 1 ~compRegistered~0)) .cse14 .cse18)) (.cse10 (not (= |old(~s~0)| ~MPR3~0))) (.cse11 (not (= |old(~customIrp~0)| 0))) (.cse12 (not (<= |old(~setEventCalled~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse0 .cse3 .cse14 (not (= 1 |old(~s~0)|)) .cse15 .cse6 .cse8 .cse16 .cse17 .cse18 .cse11) (or .cse13 (not (= 1 ~pended~0)) .cse15 .cse6 .cse8 (= ~s~0 ~NP~0) .cse16 .cse14 .cse18) (or .cse1 .cse2 .cse3 .cse4 (or .cse0 (and (= 0 ~customIrp~0) (not (= ~MPR3~0 |old(~s~0)|)) .cse19 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) .cse5 (not (= |old(~customIrp~0)| 1)) .cse6 .cse7 .cse8 .cse9 .cse12) (or .cse1 .cse20 .cse3 .cse4 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2019-10-07 13:50:29,539 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1071) no Hoare annotation was computed. [2019-10-07 13:50:29,539 INFO L439 ceAbstractionStarter]: At program point L1073(lines 1065 1084) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse10 (not (= 0 ~pended~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse19 (not (= ~myStatus~0 0)))) (let ((.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= ~compRegistered~0 0))) (.cse1 (= ~s~0 |old(~s~0)|)) (.cse8 (= |old(~customIrp~0)| ~customIrp~0)) (.cse12 (not (<= 1 ~NP~0))) (.cse13 (not (<= ~MaximumInterfaceType~0 0))) (.cse9 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse14 (not (<= ~NP~0 1))) (.cse15 (and .cse19 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse3 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse16 (not (<= 1 |old(~setEventCalled~0)|))) (.cse4 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse17 (or .cse0 .cse10 (not (<= 1 ~compRegistered~0)) .cse6 .cse7)) (.cse20 (not (= |old(~s~0)| ~MPR3~0))) (.cse11 (not (= |old(~customIrp~0)| 0))) (.cse18 (not (<= |old(~setEventCalled~0)| 1)))) (and (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (and (= 1 ~s~0) .cse8) .cse9 .cse6 (not (= 1 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11) (or .cse12 (and .cse1 (not (= ~MPR3~0 ~s~0)) .cse8 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse13 .cse9 .cse14 .cse15 (not (= |old(~customIrp~0)| 1)) .cse3 .cse16 .cse4 .cse17 .cse18) (or .cse3 .cse16 .cse12 .cse4 .cse19 .cse9 .cse17 .cse20 .cse14 .cse11 .cse18) (or .cse12 .cse13 .cse9 .cse14 .cse15 .cse3 .cse16 .cse4 .cse17 .cse20 .cse11 .cse18)))) [2019-10-07 13:50:29,540 INFO L443 ceAbstractionStarter]: For program point L1065(lines 1065 1084) no Hoare annotation was computed. [2019-10-07 13:50:29,540 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1060 1101) the Hoare annotation is: (let ((.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse19 (not (= 0 ~pended~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse13 (= |old(~customIrp~0)| ~customIrp~0)) (.cse14 (<= 1 ~setEventCalled~0)) (.cse15 (<= ~setEventCalled~0 1)) (.cse23 (not (= ~myStatus~0 0)))) (let ((.cse4 (= ~s~0 |old(~s~0)|)) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse5 (not (= ~compRegistered~0 0))) (.cse9 (not (<= ~MaximumInterfaceType~0 0))) (.cse12 (and .cse23 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse8 (not (<= 1 ~NP~0))) (.cse10 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse11 (not (<= ~NP~0 1))) (.cse21 (and (= ~MPR3~0 ~s~0) .cse13 .cse14 .cse15)) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse16 (not (<= 1 |old(~setEventCalled~0)|))) (.cse3 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse17 (or .cse0 .cse19 (not (<= 1 ~compRegistered~0)) .cse6 .cse7)) (.cse22 (not (= |old(~s~0)| ~MPR3~0))) (.cse20 (not (= |old(~customIrp~0)| 0))) (.cse18 (not (<= |old(~setEventCalled~0)| 1)))) (and (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse4 .cse13 .cse14 .cse15) (not (= |old(~customIrp~0)| 1)) .cse2 .cse16 .cse3 .cse17 .cse18) (or .cse0 .cse10 .cse6 (not (= 1 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse5 .cse19 (and (= 1 ~s~0) .cse13) .cse7 .cse20) (or .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse2 .cse16 .cse3 .cse17 .cse22 .cse20 .cse18) (or .cse8 .cse23 .cse10 .cse11 .cse21 .cse2 .cse16 .cse3 .cse17 .cse22 .cse20 .cse18)))) [2019-10-07 13:50:29,540 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 (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse3 (not (= 0 ~pended~0))) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (not (= 1 ~pended~0)) .cse0 .cse1 .cse2 .cse5 .cse6) (or (= 1 ~s~0) (or (or .cse4 .cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) .cse3 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) .cse5 .cse6) (not (= 1 |old(~s~0)|)))))) [2019-10-07 13:50:29,540 INFO L439 ceAbstractionStarter]: At program point L1046(line 1046) the Hoare annotation is: (let ((.cse2 (not (= 0 ~pended~0))) (.cse3 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse0 (not (= |old(~s~0)| ~NP~0))) (.cse1 (not (= ~compRegistered~0 0))) (.cse4 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2) (or (or .cse3 .cse0 (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) .cse2 (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) .cse4 .cse5) (not (= 1 |old(~s~0)|))) (or .cse3 (not (= 1 ~pended~0)) .cse0 .cse1 .cse4 .cse5))) [2019-10-07 13:50:29,541 INFO L443 ceAbstractionStarter]: For program point L1046-1(lines 1038 1051) no Hoare annotation was computed. [2019-10-07 13:50:29,541 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1038 1051) no Hoare annotation was computed. [2019-10-07 13:50:29,541 INFO L443 ceAbstractionStarter]: For program point L1042(lines 1042 1048) no Hoare annotation was computed. [2019-10-07 13:50:29,541 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2019-10-07 13:50:29,541 INFO L439 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 433 600) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~compRegistered~0) (= 1 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,541 INFO L439 ceAbstractionStarter]: At program point L507(line 507) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (and (<= 1 ~compRegistered~0) (= 1 ~s~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,541 INFO L443 ceAbstractionStarter]: For program point L507-1(line 507) no Hoare annotation was computed. [2019-10-07 13:50:29,542 INFO L439 ceAbstractionStarter]: At program point L532(line 532) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (not (= ~myStatus~0 259))) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,542 INFO L443 ceAbstractionStarter]: For program point L532-1(line 532) no Hoare annotation was computed. [2019-10-07 13:50:29,542 INFO L439 ceAbstractionStarter]: At program point L557(lines 557 559) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,542 INFO L443 ceAbstractionStarter]: For program point L557-1(lines 557 559) no Hoare annotation was computed. [2019-10-07 13:50:29,542 INFO L439 ceAbstractionStarter]: At program point L549-2(lines 549 565) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and (= 0 FloppyStartDevice_~InterfaceType~0) (not (= FloppyStartDevice_~ntStatus~1 259)) (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (not (= ~myStatus~0 259)))) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,543 INFO L439 ceAbstractionStarter]: At program point L566(lines 527 592) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (and (not (= FloppyStartDevice_~ntStatus~1 259)) (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (not (= ~myStatus~0 259)))) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,543 INFO L439 ceAbstractionStarter]: At program point L525(line 525) the Hoare annotation is: (or (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,543 INFO L439 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,543 INFO L443 ceAbstractionStarter]: For program point L525-1(line 525) no Hoare annotation was computed. [2019-10-07 13:50:29,543 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 588) no Hoare annotation was computed. [2019-10-07 13:50:29,543 INFO L443 ceAbstractionStarter]: For program point L550(lines 549 565) no Hoare annotation was computed. [2019-10-07 13:50:29,543 INFO L443 ceAbstractionStarter]: For program point L583-2(lines 583 588) no Hoare annotation was computed. [2019-10-07 13:50:29,544 INFO L439 ceAbstractionStarter]: At program point L542(lines 529 569) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (not (= FloppyStartDevice_~ntStatus~1 259)) (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (not (= ~myStatus~0 259)))) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,544 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 592) no Hoare annotation was computed. [2019-10-07 13:50:29,544 INFO L443 ceAbstractionStarter]: For program point L527-1(lines 527 592) no Hoare annotation was computed. [2019-10-07 13:50:29,544 INFO L443 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 433 600) no Hoare annotation was computed. [2019-10-07 13:50:29,544 INFO L439 ceAbstractionStarter]: At program point L585(lines 585 586) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (and (not (= FloppyStartDevice_~ntStatus~1 259)) (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (not (= ~myStatus~0 259)))) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,544 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 585 586) no Hoare annotation was computed. [2019-10-07 13:50:29,544 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 516) no Hoare annotation was computed. [2019-10-07 13:50:29,545 INFO L443 ceAbstractionStarter]: For program point L511-2(lines 511 516) no Hoare annotation was computed. [2019-10-07 13:50:29,545 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2019-10-07 13:50:29,545 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 501) no Hoare annotation was computed. [2019-10-07 13:50:29,545 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 490 502) no Hoare annotation was computed. [2019-10-07 13:50:29,545 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 569) no Hoare annotation was computed. [2019-10-07 13:50:29,545 INFO L439 ceAbstractionStarter]: At program point L513(line 513) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (<= 1 ~compRegistered~0) (= ~MPR3~0 ~s~0) (= FloppyStartDevice_~__cil_tmp42~0 259) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,545 INFO L443 ceAbstractionStarter]: For program point L513-1(line 513) no Hoare annotation was computed. [2019-10-07 13:50:29,545 INFO L439 ceAbstractionStarter]: At program point L571-2(lines 571 578) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (and (not (= FloppyStartDevice_~ntStatus~1 259)) (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (not (= ~myStatus~0 259)))) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,546 INFO L439 ceAbstractionStarter]: At program point L596(line 596) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (and (and (<= 1 ~compRegistered~0) (= 1 ~s~0)) (not (= FloppyStartDevice_~ntStatus~1 259))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,546 INFO L443 ceAbstractionStarter]: For program point L596-1(line 596) no Hoare annotation was computed. [2019-10-07 13:50:29,546 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 540) no Hoare annotation was computed. [2019-10-07 13:50:29,546 INFO L439 ceAbstractionStarter]: At program point L497(line 497) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 ~pended~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,546 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 581) no Hoare annotation was computed. [2019-10-07 13:50:29,546 INFO L443 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1124 1145) no Hoare annotation was computed. [2019-10-07 13:50:29,547 INFO L446 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1124 1145) the Hoare annotation is: true [2019-10-07 13:50:29,547 INFO L443 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1102 1123) no Hoare annotation was computed. [2019-10-07 13:50:29,547 INFO L446 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1102 1123) the Hoare annotation is: true [2019-10-07 13:50:29,547 INFO L443 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 839 863) no Hoare annotation was computed. [2019-10-07 13:50:29,547 INFO L439 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 839 863) the Hoare annotation is: (or (= |old(~customIrp~0)| ~customIrp~0) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 ~s~0)) (not (= ~s~0 ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637))))) [2019-10-07 13:50:29,547 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1052 1059) the Hoare annotation is: true [2019-10-07 13:50:29,547 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1052 1059) no Hoare annotation was computed. [2019-10-07 13:50:29,547 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 653 665) no Hoare annotation was computed. [2019-10-07 13:50:29,548 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 653 665) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637)))) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:29,548 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 1622 1629) the Hoare annotation is: true [2019-10-07 13:50:29,548 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 1622 1629) no Hoare annotation was computed. [2019-10-07 13:50:29,548 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1626) no Hoare annotation was computed. [2019-10-07 13:50:29,548 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 135) no Hoare annotation was computed. [2019-10-07 13:50:29,548 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-10-07 13:50:29,549 INFO L439 ceAbstractionStarter]: At program point L153(line 153) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= ~s~0 ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,549 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 149 155) no Hoare annotation was computed. [2019-10-07 13:50:29,549 INFO L439 ceAbstractionStarter]: At program point L120-2(lines 120 122) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= ~s~0 ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 0 ~pended~0) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,549 INFO L443 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 96 158) no Hoare annotation was computed. [2019-10-07 13:50:29,549 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 145) no Hoare annotation was computed. [2019-10-07 13:50:29,549 INFO L443 ceAbstractionStarter]: For program point L110(lines 110 115) no Hoare annotation was computed. [2019-10-07 13:50:29,549 INFO L439 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 96 158) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= ~s~0 ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 0 ~pended~0) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,550 INFO L443 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 96 158) no Hoare annotation was computed. [2019-10-07 13:50:29,550 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 147) no Hoare annotation was computed. [2019-10-07 13:50:29,550 INFO L443 ceAbstractionStarter]: For program point L117-2(lines 109 157) no Hoare annotation was computed. [2019-10-07 13:50:29,550 INFO L439 ceAbstractionStarter]: At program point L140(line 140) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= ~s~0 ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 0 ~pended~0) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,550 INFO L443 ceAbstractionStarter]: For program point L140-1(line 140) no Hoare annotation was computed. [2019-10-07 13:50:29,550 INFO L439 ceAbstractionStarter]: At program point L138(lines 138 139) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= ~s~0 ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (= 0 ~pended~0) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,550 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 138 139) no Hoare annotation was computed. [2019-10-07 13:50:29,551 INFO L439 ceAbstractionStarter]: At program point L981(line 981) the Hoare annotation is: (let ((.cse2 (not (= ~myStatus~0 0))) (.cse6 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse12 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse11 (not (= 0 ~pended~0))) (.cse13 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse3 (not (= ~customIrp~0 0))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse1 (let ((.cse14 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 |old(~s~0)|) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse14) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse14 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse0 (or .cse6 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse12 (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) .cse7 .cse8 .cse11 (not (<= 1 ~compRegistered~0)) .cse13)) (.cse4 (not (<= ~MaximumInterfaceType~0 0))) (.cse5 (and .cse2 (not (= 0 (+ ~myStatus~0 1073741637)))))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse4 .cse5 .cse3) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse6 (not (= 1 ~pended~0)) .cse7 .cse8 .cse9 .cse10 .cse12 .cse13) (or .cse1 .cse0 (not (= ~customIrp~0 1)) .cse4 .cse5)))) [2019-10-07 13:50:29,551 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 985) no Hoare annotation was computed. [2019-10-07 13:50:29,551 INFO L439 ceAbstractionStarter]: At program point L973-1(lines 973 985) the Hoare annotation is: (let ((.cse5 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse11 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse10 (not (= 0 ~pended~0))) (.cse12 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse14 (not (= ~myStatus~0 0)))) (let ((.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and .cse14 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse0 (or .cse5 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse11 (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse10 (not (<= 1 ~compRegistered~0)) .cse12)) (.cse3 (let ((.cse15 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse15) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse15 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse4 (not (= ~customIrp~0 0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse13 (= ~SKIP1~0 ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse3 (not (= ~customIrp~0 1)) .cse1 .cse2) (or .cse0 .cse3 .cse14 .cse4) (or .cse5 (not (= 1 ~pended~0)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse12)))) [2019-10-07 13:50:29,551 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 965 1037) the Hoare annotation is: (let ((.cse10 (not (= ~myStatus~0 0))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse5 (not (= 0 ~pended~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse12 (not (= ~customIrp~0 0))) (.cse9 (or .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse6 (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse5 (not (<= 1 ~compRegistered~0)) .cse7)) (.cse11 (= ~s~0 |old(~s~0)|)) (.cse13 (not (<= ~MaximumInterfaceType~0 0))) (.cse14 (and .cse10 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse8 (= ~SKIP1~0 ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse11 .cse12) (or .cse11 .cse9 .cse13 .cse14 .cse12) (or .cse9 (not (= ~customIrp~0 1)) .cse11 .cse13 .cse14) (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse7)))) [2019-10-07 13:50:29,552 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1033) no Hoare annotation was computed. [2019-10-07 13:50:29,552 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 965 1037) no Hoare annotation was computed. [2019-10-07 13:50:29,552 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 983) no Hoare annotation was computed. [2019-10-07 13:50:29,552 INFO L439 ceAbstractionStarter]: At program point L1008(lines 972 1036) the Hoare annotation is: (let ((.cse5 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse11 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse10 (not (= 0 ~pended~0))) (.cse12 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse14 (not (= ~myStatus~0 0)))) (let ((.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and .cse14 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse0 (or .cse5 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse11 (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse10 (not (<= 1 ~compRegistered~0)) .cse12)) (.cse3 (let ((.cse15 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse15) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse15 1) 0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))) (.cse4 (not (= ~customIrp~0 0))) (.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse13 (= ~SKIP1~0 ~s~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse3 (not (= ~customIrp~0 1)) .cse1 .cse2) (or .cse0 .cse3 .cse14 .cse4) (or .cse5 (not (= 1 ~pended~0)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse12)))) [2019-10-07 13:50:29,552 INFO L439 ceAbstractionStarter]: At program point L975(line 975) the Hoare annotation is: (let ((.cse9 (not (= ~myStatus~0 0))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse5 (not (= 0 ~pended~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse11 (not (= ~customIrp~0 0))) (.cse3 (not (= ~compRegistered~0 0))) (.cse4 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse8 (or .cse0 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse6 (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse5 (not (<= 1 ~compRegistered~0)) .cse7)) (.cse10 (= ~s~0 |old(~s~0)|)) (.cse12 (not (<= ~MaximumInterfaceType~0 0))) (.cse13 (and .cse9 (not (= 0 (+ ~myStatus~0 1073741637)))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11) (or .cse10 .cse8 .cse12 .cse13 .cse11) (or .cse0 (not (= 1 ~pended~0)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (or .cse8 (not (= ~customIrp~0 1)) .cse10 .cse12 .cse13)))) [2019-10-07 13:50:29,553 INFO L443 ceAbstractionStarter]: For program point L975-1(line 975) no Hoare annotation was computed. [2019-10-07 13:50:29,553 INFO L443 ceAbstractionStarter]: For program point L1025(lines 1025 1032) no Hoare annotation was computed. [2019-10-07 13:50:29,553 INFO L439 ceAbstractionStarter]: At program point L1030(line 1030) the Hoare annotation is: (let ((.cse12 (not (= ~myStatus~0 0))) (.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse10 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse9 (not (= 0 ~pended~0))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse3 (not (= ~customIrp~0 0))) (.cse0 (or .cse4 (not (<= (+ ~NP~0 4) ~MPR1~0)) .cse10 (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse9 (not (<= 1 ~compRegistered~0)) .cse11)) (.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and .cse12 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= ~SKIP1~0 |old(~s~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse3) (or .cse0 (not (= ~customIrp~0 1)) .cse1 .cse2) (or .cse4 (not (= 1 ~pended~0)) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11)))) [2019-10-07 13:50:29,553 INFO L443 ceAbstractionStarter]: For program point L1030-1(lines 1012 1034) no Hoare annotation was computed. [2019-10-07 13:50:29,553 INFO L439 ceAbstractionStarter]: At program point L1307(line 1307) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,553 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1286) no Hoare annotation was computed. [2019-10-07 13:50:29,553 INFO L443 ceAbstractionStarter]: For program point L1307-1(line 1307) no Hoare annotation was computed. [2019-10-07 13:50:29,554 INFO L443 ceAbstractionStarter]: For program point L1274-2(lines 1273 1562) no Hoare annotation was computed. [2019-10-07 13:50:29,554 INFO L439 ceAbstractionStarter]: At program point L1514(line 1514) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,554 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 1510 1516) no Hoare annotation was computed. [2019-10-07 13:50:29,554 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1531) no Hoare annotation was computed. [2019-10-07 13:50:29,554 INFO L439 ceAbstractionStarter]: At program point L1399(lines 1389 1529) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 1 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,554 INFO L439 ceAbstractionStarter]: At program point L1292(line 1292) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,554 INFO L443 ceAbstractionStarter]: For program point L1292-1(line 1292) no Hoare annotation was computed. [2019-10-07 13:50:29,555 INFO L439 ceAbstractionStarter]: At program point L1449(line 1449) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,555 INFO L443 ceAbstractionStarter]: For program point L1449-1(line 1449) no Hoare annotation was computed. [2019-10-07 13:50:29,555 INFO L439 ceAbstractionStarter]: At program point L1383(lines 1375 1533) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,555 INFO L443 ceAbstractionStarter]: For program point L1375(lines 1375 1533) no Hoare annotation was computed. [2019-10-07 13:50:29,555 INFO L439 ceAbstractionStarter]: At program point L1301(line 1301) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,555 INFO L439 ceAbstractionStarter]: At program point L1557(line 1557) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 1 ~pended~0) (= ~s~0 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (and (= 0 ~pended~0) (or (<= FloppyDeviceControl_~__cil_tmp91~0 FloppyDeviceControl_~ntStatus~3) (<= FloppyDeviceControl_~__cil_tmp91~0 259)) (= ~s~0 |old(~s~0)|) (or (<= FloppyDeviceControl_~ntStatus~3 258) (<= 260 FloppyDeviceControl_~ntStatus~3)) (or (<= FloppyDeviceControl_~ntStatus~3 FloppyDeviceControl_~__cil_tmp91~0) (< 258 FloppyDeviceControl_~__cil_tmp91~0))) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,556 INFO L443 ceAbstractionStarter]: For program point L1301-1(lines 1297 1303) no Hoare annotation was computed. [2019-10-07 13:50:29,556 INFO L443 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 1182 1563) no Hoare annotation was computed. [2019-10-07 13:50:29,556 INFO L439 ceAbstractionStarter]: At program point L1483(lines 1347 1541) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,556 INFO L443 ceAbstractionStarter]: For program point L1475(lines 1475 1478) no Hoare annotation was computed. [2019-10-07 13:50:29,556 INFO L443 ceAbstractionStarter]: For program point L1467(lines 1467 1480) no Hoare annotation was computed. [2019-10-07 13:50:29,556 INFO L443 ceAbstractionStarter]: For program point L1368(lines 1368 1535) no Hoare annotation was computed. [2019-10-07 13:50:29,556 INFO L439 ceAbstractionStarter]: At program point L1525(lines 1400 1526) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 1 ~pended~0) (= ~s~0 ~NP~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|) (not (= FloppyDeviceControl_~ntStatus~3 259))) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,556 INFO L443 ceAbstractionStarter]: For program point L1451(lines 1451 1454) no Hoare annotation was computed. [2019-10-07 13:50:29,557 INFO L443 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 1182 1563) no Hoare annotation was computed. [2019-10-07 13:50:29,557 INFO L439 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 1182 1563) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 1 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,557 INFO L443 ceAbstractionStarter]: For program point L1361(lines 1361 1537) no Hoare annotation was computed. [2019-10-07 13:50:29,557 INFO L439 ceAbstractionStarter]: At program point L1320(lines 1320 1547) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 1 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,557 INFO L443 ceAbstractionStarter]: For program point L1279(lines 1279 1284) no Hoare annotation was computed. [2019-10-07 13:50:29,557 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1481) no Hoare annotation was computed. [2019-10-07 13:50:29,557 INFO L443 ceAbstractionStarter]: For program point L1329(lines 1329 1545) no Hoare annotation was computed. [2019-10-07 13:50:29,558 INFO L443 ceAbstractionStarter]: For program point L1296(lines 1296 1310) no Hoare annotation was computed. [2019-10-07 13:50:29,558 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1543) no Hoare annotation was computed. [2019-10-07 13:50:29,558 INFO L443 ceAbstractionStarter]: For program point L1462(lines 1462 1465) no Hoare annotation was computed. [2019-10-07 13:50:29,558 INFO L443 ceAbstractionStarter]: For program point L1297(lines 1297 1303) no Hoare annotation was computed. [2019-10-07 13:50:29,558 INFO L443 ceAbstractionStarter]: For program point L1553(lines 1553 1559) no Hoare annotation was computed. [2019-10-07 13:50:29,558 INFO L439 ceAbstractionStarter]: At program point L1520(lines 1520 1521) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,558 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 1553 1559) no Hoare annotation was computed. [2019-10-07 13:50:29,558 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 1520 1521) no Hoare annotation was computed. [2019-10-07 13:50:29,559 INFO L443 ceAbstractionStarter]: For program point L1347(lines 1347 1541) no Hoare annotation was computed. [2019-10-07 13:50:29,559 INFO L439 ceAbstractionStarter]: At program point L1281(line 1281) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,559 INFO L443 ceAbstractionStarter]: For program point L1281-1(line 1281) no Hoare annotation was computed. [2019-10-07 13:50:29,559 INFO L443 ceAbstractionStarter]: For program point L1471(lines 1471 1479) no Hoare annotation was computed. [2019-10-07 13:50:29,559 INFO L439 ceAbstractionStarter]: At program point L1339(lines 1329 1545) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,559 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-10-07 13:50:29,559 INFO L443 ceAbstractionStarter]: For program point L1356(lines 1356 1539) no Hoare annotation was computed. [2019-10-07 13:50:29,560 INFO L439 ceAbstractionStarter]: At program point L1315(lines 1315 1549) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (= 0 ~pended~0) (= 1 ~s~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,560 INFO L443 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 1564 1580) no Hoare annotation was computed. [2019-10-07 13:50:29,560 INFO L446 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 1564 1580) the Hoare annotation is: true [2019-10-07 13:50:29,560 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-10-07 13:50:29,560 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:50:29,560 INFO L439 ceAbstractionStarter]: At program point L1598(line 1598) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,560 INFO L443 ceAbstractionStarter]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2019-10-07 13:50:29,561 INFO L443 ceAbstractionStarter]: For program point L1590-2(lines 1588 1619) no Hoare annotation was computed. [2019-10-07 13:50:29,561 INFO L439 ceAbstractionStarter]: At program point L1613(line 1613) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,561 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 1609 1615) no Hoare annotation was computed. [2019-10-07 13:50:29,561 INFO L443 ceAbstractionStarter]: For program point L1609(lines 1609 1615) no Hoare annotation was computed. [2019-10-07 13:50:29,561 INFO L443 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 1581 1620) no Hoare annotation was computed. [2019-10-07 13:50:29,561 INFO L439 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 1581 1620) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (and (= 0 ~pended~0) (= ~s~0 |old(~s~0)|)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) [2019-10-07 13:50:29,561 INFO L443 ceAbstractionStarter]: For program point L1593-1(lines 1593 1617) no Hoare annotation was computed. [2019-10-07 13:50:29,562 INFO L439 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: (or (and (= 1 ~customIrp~0) (or (= FlFdcDeviceIo_~__cil_tmp11~0 259) (and (<= ~s~0 ~NP~0) (<= ~NP~0 ~s~0))) (= FlFdcDeviceIo_~__cil_tmp11~0 FlFdcDeviceIo_~ntStatus~2) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637))))) [2019-10-07 13:50:29,562 INFO L443 ceAbstractionStarter]: For program point L638-1(line 638) no Hoare annotation was computed. [2019-10-07 13:50:29,562 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 641) no Hoare annotation was computed. [2019-10-07 13:50:29,562 INFO L439 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 611 645) the Hoare annotation is: (or (and (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637))))) [2019-10-07 13:50:29,562 INFO L443 ceAbstractionStarter]: For program point L636-2(lines 636 641) no Hoare annotation was computed. [2019-10-07 13:50:29,562 INFO L439 ceAbstractionStarter]: At program point L632(line 632) the Hoare annotation is: (or (and (= 1 ~customIrp~0) (= ~s~0 |old(~s~0)|)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637))))) [2019-10-07 13:50:29,562 INFO L443 ceAbstractionStarter]: For program point L632-1(line 632) no Hoare annotation was computed. [2019-10-07 13:50:29,563 INFO L443 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 611 645) no Hoare annotation was computed. [2019-10-07 13:50:29,563 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 628) no Hoare annotation was computed. [2019-10-07 13:50:29,563 INFO L439 ceAbstractionStarter]: At program point L623(lines 623 624) the Hoare annotation is: (or (and (= 1 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= ~MaximumInterfaceType~0 0)) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (= 1 |old(~s~0)|)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637))))) [2019-10-07 13:50:29,563 INFO L443 ceAbstractionStarter]: For program point L623-1(lines 623 624) no Hoare annotation was computed. [2019-10-07 13:50:29,563 INFO L443 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 611 645) no Hoare annotation was computed. [2019-10-07 13:50:29,563 INFO L446 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 89 95) the Hoare annotation is: true [2019-10-07 13:50:29,563 INFO L443 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 89 95) no Hoare annotation was computed. [2019-10-07 13:50:29,564 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:50:29,564 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) (= ~s~0 ~SKIP2~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (= ~s~0 ~DC~0) (= ~MPR3~0 ~s~0) (= 0 ~customIrp~0) (<= ~MaximumInterfaceType~0 0) (= ~SKIP1~0 ~s~0)) [2019-10-07 13:50:29,564 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:50:29,564 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:50:29,564 INFO L446 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 864 884) the Hoare annotation is: true [2019-10-07 13:50:29,564 INFO L443 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 864 884) no Hoare annotation was computed. [2019-10-07 13:50:29,564 INFO L443 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 885 907) no Hoare annotation was computed. [2019-10-07 13:50:29,564 INFO L446 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 885 907) the Hoare annotation is: true [2019-10-07 13:50:29,564 INFO L446 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1146 1166) the Hoare annotation is: true [2019-10-07 13:50:29,565 INFO L443 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1146 1166) no Hoare annotation was computed. [2019-10-07 13:50:29,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:50:29 BoogieIcfgContainer [2019-10-07 13:50:29,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:50:29,620 INFO L168 Benchmark]: Toolchain (without parser) took 45565.95 ms. Allocated memory was 137.9 MB in the beginning and 752.9 MB in the end (delta: 615.0 MB). Free memory was 102.2 MB in the beginning and 475.9 MB in the end (delta: -373.6 MB). Peak memory consumption was 639.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:29,620 INFO L168 Benchmark]: CDTParser took 1.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-07 13:50:29,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.95 ms. Allocated memory was 137.9 MB in the beginning and 199.2 MB in the end (delta: 61.3 MB). Free memory was 102.0 MB in the beginning and 164.1 MB in the end (delta: -62.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:29,621 INFO L168 Benchmark]: Boogie Preprocessor took 91.53 ms. Allocated memory is still 199.2 MB. Free memory was 164.1 MB in the beginning and 159.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:29,622 INFO L168 Benchmark]: RCFGBuilder took 1897.77 ms. Allocated memory was 199.2 MB in the beginning and 232.3 MB in the end (delta: 33.0 MB). Free memory was 159.3 MB in the beginning and 99.9 MB in the end (delta: 59.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:29,622 INFO L168 Benchmark]: TraceAbstraction took 42838.91 ms. Allocated memory was 232.3 MB in the beginning and 752.9 MB in the end (delta: 520.6 MB). Free memory was 99.9 MB in the beginning and 475.9 MB in the end (delta: -376.0 MB). Peak memory consumption was 543.2 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:29,625 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.95 ms. Allocated memory was 137.9 MB in the beginning and 199.2 MB in the end (delta: 61.3 MB). Free memory was 102.0 MB in the beginning and 164.1 MB in the end (delta: -62.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.53 ms. Allocated memory is still 199.2 MB. Free memory was 164.1 MB in the beginning and 159.3 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1897.77 ms. Allocated memory was 199.2 MB in the beginning and 232.3 MB in the end (delta: 33.0 MB). Free memory was 159.3 MB in the beginning and 99.9 MB in the end (delta: 59.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42838.91 ms. Allocated memory was 232.3 MB in the beginning and 752.9 MB in the end (delta: 520.6 MB). Free memory was 99.9 MB in the beginning and 475.9 MB in the end (delta: -376.0 MB). Peak memory consumption was 543.2 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: 839]: Loop Invariant Derived loop invariant: ((\old(customIrp) == customIrp || !(MaximumInterfaceType <= 0)) || (((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == s)) || !(s == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637)) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && s <= NP) && status == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && (myStatus == 0 || myStatus + 1073741637 == 0)) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0)) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == s && \old(customIrp) == customIrp) || !(1 <= NP)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(DC + NP + 7 <= SKIP1 + IPC)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) || !(\old(setEventCalled) <= 1)) && (((((((((((!(NP + 5 <= MPR3) || (1 == s && \old(customIrp) == customIrp)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == pended)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) && ((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || s == NP) || !(compRegistered == 0)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC))) && (((((((((((!(1 <= NP) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || (1 == s && \old(customIrp) == customIrp) || ((((0 == customIrp && !(MPR3 == \old(s))) && 1 == s) && 1 <= setEventCalled) && setEventCalled <= 1)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) || !(\old(customIrp) == 1)) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(DC + NP + 7 <= SKIP1 + IPC)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(setEventCalled) <= 1))) && (((((((((((!(1 <= NP) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || (1 == s && \old(customIrp) == customIrp)) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(DC + NP + 7 <= SKIP1 + IPC)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) || !(\old(setEventCalled) <= 1)) - InvariantResult [Line: 972]: Loop Invariant Derived loop invariant: ((((((((((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(MaximumInterfaceType <= 0)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) || (((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 0)) && ((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || SKIP1 == s)) && (((((((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || (((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 1)) || !(MaximumInterfaceType <= 0)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637)))) && ((((((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || (((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(myStatus == 0)) || !(customIrp == 0))) && ((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || SKIP1 == s) || !(DC + 5 <= IPC)) - InvariantResult [Line: 1146]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(MaximumInterfaceType <= 0)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) || (((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 0)) && ((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || SKIP1 == s)) && (((((((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || (((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(customIrp == 1)) || !(MaximumInterfaceType <= 0)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637)))) && ((((((((((((!(NP + 5 <= MPR3) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || (((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(myStatus == 0)) || !(customIrp == 0))) && ((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(DC + 2 <= SKIP2)) || SKIP1 == s) || !(DC + 5 <= IPC)) - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 5 <= MPR3) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(DC + 5 <= IPC)) || ((0 == InterfaceType && !(ntStatus == 259)) && (1 <= compRegistered && 1 == s) && !(myStatus == 259))) || !(\old(customIrp) == 0) - InvariantResult [Line: 787]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((status <= 258 || 260 <= status) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (1 == pended && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) || !(\old(s) == \old(DC))) || (status == 0 && s == DC)) || !(\old(compRegistered) == 0)) || ((((((status == lowerDriverReturn && s == IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && compRegistered <= 0)) || (((((((status == lowerDriverReturn && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((1 == pended && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (status + 1073741738 <= 0 && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) || (((((s == IPC && 1 == pended) && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 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(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \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)) || ((((status <= 258 || 260 <= status) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && (((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s == DC)) || !(\old(s) == \old(DC))) || (((((((1 == pended && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || (((((((status == lowerDriverReturn && s == IPC) && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && compRegistered <= 0)) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2)) || !(\old(s) == \old(MPR1))) || ((status == 0 && 0 == pended) && s == DC)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s == DC) && status + 1073741738 <= 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 5 <= MPR3) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || (((0 == pended && 0 == compRegistered) && 1 == s) && \old(customIrp) == customIrp)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 5 <= MPR3) || ((0 == pended && 0 == compRegistered) && 1 == s)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 797]: Loop Invariant Derived loop invariant: ((((((((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || ((NP + DC + 7 <= IPC + SKIP1 && DC + 7 <= 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)))) || (status == 0 && s == DC)) || !(\old(compRegistered) == 0)) || (SKIP2 <= s && SKIP1 + 2 <= MPR1 && NP + DC + 7 <= IPC + SKIP1 && (((((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(MPR1))) || (status + 1073741738 <= 0 && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) || (((status <= 258 || 260 <= status) && SKIP1 + 2 <= MPR1) && NP + DC + 7 <= IPC + SKIP1 && (((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && compRegistered <= 0) || (((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)))) || (((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && DC + 2 <= SKIP2)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1124]: 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(MPR1))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1320]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || (0 == pended && 1 == s)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 5 <= MPR3) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(1 == \old(s))) || (!(ntStatus == 259) && (1 <= compRegistered && 1 == s) && !(myStatus == 259))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 885]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 221]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 5 <= MPR3) || ((0 == pended && 0 == compRegistered) && 1 == s)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || ((((((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && s <= NP) && status == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s) && (myStatus == 0 || myStatus + 1073741637 == 0)) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0)) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1347]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || (0 == pended && s == \old(s))) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 779]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((1 == pended && s == SKIP2) && NP + 5 <= MPR3) && DC + 5 <= IPC) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((1 == pended && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == compRegistered) && DC + 2 <= SKIP2) && s == DC)) || !(\old(s) == \old(DC))) || (((((s == IPC && 1 == pended) && NP + 5 <= MPR3) && DC + 5 <= IPC) && 0 == compRegistered) && DC + 2 <= SKIP2)) || !(\old(compRegistered) == 0)) || (((((((status == lowerDriverReturn && s == IPC) && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && compRegistered <= 0)) || ((((((((status == lowerDriverReturn && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && 0 == pended) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || ((((status <= 258 || 260 <= status) && NP + DC + 7 <= IPC + SKIP1) && (((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s == DC) && SKIP1 + 2 <= MPR1)) || ((status == 0 && 0 == pended) && s == DC)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || (((((DC + 5 <= IPC && NP + 5 <= MPR3) && 0 == pended) && DC + 2 <= SKIP2) && s == DC) && status + 1073741738 <= 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1400]: Loop Invariant Derived loop invariant: ((((((((((!(NP + 5 <= MPR3) || (1 == pended && s == NP)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || ((0 == pended && s == \old(s)) && !(ntStatus == 259))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 1102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 864]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1389]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || (0 == pended && 1 == s)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 930]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 5 <= MPR3) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(1 == \old(s))) || (((((!(myStatus == 259) && 0 == pended) && 0 == compRegistered) && !(259 == ntStatus)) && 1 == s) && \old(customIrp) == customIrp)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1315]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || (0 == pended && 1 == s)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (((((((((((((((((0 == pended && 0 == compRegistered) && 0 == ntStatus) && 1 == s) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp) || !(NP + 5 <= MPR3)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 739]: Loop Invariant Derived loop invariant: (((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || (((((((((((DC + 5 <= IPC && 0 == pended) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && s <= NP) && status == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP <= 1) && 1 == s)) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 5 <= MPR3) || ((0 == pended && 0 == compRegistered) && s == \old(s))) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1329]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || (0 == pended && s == \old(s))) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(NP + 5 <= MPR3) || ((((s == IPC && 0 == pended) && lowerDriverReturn == ntStatus) && IPC + SKIP1 <= s + \old(s)) && compRegistered <= 0)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || ((1 == pended && 0 == compRegistered) && s == DC)) || ((s == IPC && 1 == pended) && 0 == compRegistered)) || !(SKIP1 + 2 <= MPR1)) || ((1 == pended && s == SKIP2) && 0 == compRegistered)) || !(\old(compRegistered) == 0)) || ((0 == pended && s == DC) && !(259 == ntStatus))) || !(1 <= NP)) || !(DC + 2 <= SKIP2)) || !(NP <= 1)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(\old(s) == NP)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == \old(pended))) || (((s == SKIP2 && 0 == pended) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || !(1 == pended)) || s == \old(s)) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) && (((((((((((!(NP + 5 <= MPR3) || (1 == s && \old(customIrp) == customIrp)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == pended)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) && (((((((((((!(1 <= NP) || ((((s == \old(s) && !(MPR3 == s)) && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) || !(\old(customIrp) == 1)) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(DC + NP + 7 <= SKIP1 + IPC)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(setEventCalled) <= 1))) && ((((((((((!(SKIP1 + 2 <= MPR1) || !(1 <= \old(setEventCalled))) || !(1 <= NP)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(s) == MPR3)) || !(NP <= 1)) || !(\old(customIrp) == 0)) || !(\old(setEventCalled) <= 1))) && (((((((((((!(1 <= NP) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(NP <= 1)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) || !(SKIP1 + 2 <= MPR1)) || !(1 <= \old(setEventCalled))) || !(DC + NP + 7 <= SKIP1 + IPC)) || (((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(s) == MPR3)) || !(\old(customIrp) == 0)) || !(\old(setEventCalled) <= 1)) - InvariantResult [Line: 529]: Loop Invariant Derived loop invariant: ((((((((((((!(NP + 5 <= MPR3) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || (!(ntStatus == 259) && (1 <= compRegistered && 1 == s) && !(myStatus == 259))) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1375]: Loop Invariant Derived loop invariant: (((((((((!(NP + 5 <= MPR3) || (0 == pended && s == \old(s))) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(1 == \old(s))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC) - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 306 locations, 1 error locations. Result: SAFE, OverallTime: 42.7s, OverallIterations: 53, TraceHistogramMax: 2, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.7s, HoareTripleCheckerStatistics: 16034 SDtfs, 8043 SDslu, 45895 SDs, 0 SdLazy, 10394 SolverSat, 1830 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 146 SyntacticMatches, 9 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=603occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 53 MinimizatonAttempts, 922 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 123 LocationsWithAnnotation, 938 PreInvPairs, 1134 NumberOfFragments, 12710 HoareAnnotationTreeSize, 938 FomulaSimplifications, 394423 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 123 FomulaSimplificationsInter, 195056 FormulaSimplificationTreeSizeReductionInter, 21.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2927 NumberOfCodeBlocks, 2927 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2874 ConstructedInterpolants, 0 QuantifiedInterpolants, 378080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 PerfectInterpolantSequences, 120/120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...