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_simpl3.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:49:34,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:49:34,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:49:34,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:49:34,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:49:34,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:49:34,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:49:34,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:49:34,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:49:34,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:49:34,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:49:34,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:49:34,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:49:34,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:49:34,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:49:34,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:49:34,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:49:35,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:49:35,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:49:35,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:49:35,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:49:35,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:49:35,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:49:35,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:49:35,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:49:35,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:49:35,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:49:35,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:49:35,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:49:35,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:49:35,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:49:35,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:49:35,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:49:35,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:49:35,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:49:35,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:49:35,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:49:35,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:49:35,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:49:35,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:49:35,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:49:35,034 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:35,054 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:49:35,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:49:35,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:49:35,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:49:35,057 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:49:35,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:49:35,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:49:35,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:49:35,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:49:35,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:49:35,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:49:35,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:49:35,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:49:35,060 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:49:35,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:49:35,060 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:49:35,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:49:35,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:49:35,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:49:35,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:49:35,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:49:35,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:49:35,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:49:35,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:49:35,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:49:35,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:49:35,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:49:35,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:49:35,063 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:35,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:49:35,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:49:35,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:49:35,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:49:35,409 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:49:35,410 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-10-07 13:49:35,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bff6a2a/36933e0970e34645bd977abb953a013d/FLAG5d2ee1239 [2019-10-07 13:49:35,917 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:49:35,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-10-07 13:49:35,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bff6a2a/36933e0970e34645bd977abb953a013d/FLAG5d2ee1239 [2019-10-07 13:49:36,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bff6a2a/36933e0970e34645bd977abb953a013d [2019-10-07 13:49:36,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:49:36,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:49:36,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:49:36,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:49:36,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:49:36,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:49:36" (1/1) ... [2019-10-07 13:49:36,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e4e7eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:36, skipping insertion in model container [2019-10-07 13:49:36,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:49:36" (1/1) ... [2019-10-07 13:49:36,245 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:49:36,302 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:49:36,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:49:36,629 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:49:36,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:49:36,852 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:49:36,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:36 WrapperNode [2019-10-07 13:49:36,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:49:36,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:49:36,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:49:36,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:49:36,867 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:36" (1/1) ... [2019-10-07 13:49:36,868 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:36" (1/1) ... [2019-10-07 13:49:36,884 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:36" (1/1) ... [2019-10-07 13:49:36,884 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:36" (1/1) ... [2019-10-07 13:49:36,908 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:36" (1/1) ... [2019-10-07 13:49:36,924 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:36" (1/1) ... [2019-10-07 13:49:36,929 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:36" (1/1) ... [2019-10-07 13:49:36,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:49:36,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:49:36,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:49:36,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:49:36,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:36" (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:37,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:49:37,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:49:37,013 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-07 13:49:37,013 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-07 13:49:37,013 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-07 13:49:37,014 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-07 13:49:37,014 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-07 13:49:37,014 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-07 13:49:37,014 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-07 13:49:37,014 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-07 13:49:37,014 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-07 13:49:37,015 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-07 13:49:37,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:49:37,015 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-07 13:49:37,015 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-07 13:49:37,015 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-07 13:49:37,016 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-07 13:49:37,016 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-07 13:49:37,016 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-07 13:49:37,016 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-07 13:49:37,016 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-07 13:49:37,016 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-07 13:49:37,016 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-07 13:49:37,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-07 13:49:37,017 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-07 13:49:37,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-07 13:49:37,017 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-07 13:49:37,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:49:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 13:49:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:49:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-07 13:49:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 13:49:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-07 13:49:37,018 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-07 13:49:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-07 13:49:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-07 13:49:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-07 13:49:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-07 13:49:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-07 13:49:37,019 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-07 13:49:37,020 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-07 13:49:37,020 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-07 13:49:37,020 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-07 13:49:37,020 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-07 13:49:37,020 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-07 13:49:37,020 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-07 13:49:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-07 13:49:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-07 13:49:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-07 13:49:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-07 13:49:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-07 13:49:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-07 13:49:37,021 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-07 13:49:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-07 13:49:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:49:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-07 13:49:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-07 13:49:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:49:37,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:49:37,299 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:37,374 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:37,374 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:37,397 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:37,407 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:37,407 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:37,414 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:37,647 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-07 13:49:37,647 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-07 13:49:37,649 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:37,713 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-10-07 13:49:37,714 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-10-07 13:49:37,727 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:37,747 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-07 13:49:37,747 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-07 13:49:37,835 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:37,846 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:37,847 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:37,847 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:37,862 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:37,862 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:37,863 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:37,873 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:37,873 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:37,922 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:37,977 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-07 13:49:37,977 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-07 13:49:38,008 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:38,014 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:38,014 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:38,015 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:38,032 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:38,033 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:38,033 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-07 13:49:38,038 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-07 13:49:38,038 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-07 13:49:38,377 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:49:38,378 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:49:38,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:49:38 BoogieIcfgContainer [2019-10-07 13:49:38,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:49:38,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:49:38,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:49:38,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:49:38,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:49:36" (1/3) ... [2019-10-07 13:49:38,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ab07e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:49:38, skipping insertion in model container [2019-10-07 13:49:38,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:49:36" (2/3) ... [2019-10-07 13:49:38,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ab07e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:49:38, skipping insertion in model container [2019-10-07 13:49:38,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:49:38" (3/3) ... [2019-10-07 13:49:38,388 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-10-07 13:49:38,397 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:49:38,406 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:49:38,417 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:49:38,443 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:49:38,443 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:49:38,443 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:49:38,443 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:49:38,443 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:49:38,444 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:49:38,444 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:49:38,444 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:49:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states. [2019-10-07 13:49:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:49:38,472 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:38,473 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:38,475 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:38,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:38,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1497224750, now seen corresponding path program 1 times [2019-10-07 13:49:38,489 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:38,490 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:38,490 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:38,490 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:38,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:38,724 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:38,725 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:38,725 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:38,726 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:38,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:38,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:38,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:38,747 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 3 states. [2019-10-07 13:49:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:38,897 INFO L93 Difference]: Finished difference Result 397 states and 575 transitions. [2019-10-07 13:49:38,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:38,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-07 13:49:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:38,917 INFO L225 Difference]: With dead ends: 397 [2019-10-07 13:49:38,917 INFO L226 Difference]: Without dead ends: 227 [2019-10-07 13:49:38,925 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:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-07 13:49:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-10-07 13:49:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-07 13:49:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 297 transitions. [2019-10-07 13:49:39,030 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 297 transitions. Word has length 18 [2019-10-07 13:49:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:39,030 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 297 transitions. [2019-10-07 13:49:39,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 297 transitions. [2019-10-07 13:49:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 13:49:39,033 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:39,033 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] [2019-10-07 13:49:39,033 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:39,035 INFO L82 PathProgramCache]: Analyzing trace with hash -726168722, now seen corresponding path program 1 times [2019-10-07 13:49:39,035 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:39,035 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:39,036 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:39,036 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:39,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:39,280 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:39,281 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:39,281 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:39,281 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:39,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:39,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:39,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:39,284 INFO L87 Difference]: Start difference. First operand 227 states and 297 transitions. Second operand 3 states. [2019-10-07 13:49:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:39,505 INFO L93 Difference]: Finished difference Result 416 states and 544 transitions. [2019-10-07 13:49:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:39,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-07 13:49:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:39,511 INFO L225 Difference]: With dead ends: 416 [2019-10-07 13:49:39,512 INFO L226 Difference]: Without dead ends: 292 [2019-10-07 13:49:39,516 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:39,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-07 13:49:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2019-10-07 13:49:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-07 13:49:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 373 transitions. [2019-10-07 13:49:39,576 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 373 transitions. Word has length 22 [2019-10-07 13:49:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:39,577 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 373 transitions. [2019-10-07 13:49:39,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 373 transitions. [2019-10-07 13:49:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-07 13:49:39,578 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:39,578 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] [2019-10-07 13:49:39,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash -451141895, now seen corresponding path program 1 times [2019-10-07 13:49:39,579 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:39,579 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:39,580 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:39,580 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:39,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:39,766 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:39,766 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:39,767 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:39,767 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:39,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:39,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:39,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:39,769 INFO L87 Difference]: Start difference. First operand 289 states and 373 transitions. Second operand 3 states. [2019-10-07 13:49:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:39,818 INFO L93 Difference]: Finished difference Result 605 states and 786 transitions. [2019-10-07 13:49:39,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:39,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-07 13:49:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:39,827 INFO L225 Difference]: With dead ends: 605 [2019-10-07 13:49:39,828 INFO L226 Difference]: Without dead ends: 443 [2019-10-07 13:49:39,829 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:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-07 13:49:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 415. [2019-10-07 13:49:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-10-07 13:49:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 542 transitions. [2019-10-07 13:49:39,875 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 542 transitions. Word has length 24 [2019-10-07 13:49:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:39,876 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 542 transitions. [2019-10-07 13:49:39,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 542 transitions. [2019-10-07 13:49:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 13:49:39,878 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:39,878 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] [2019-10-07 13:49:39,878 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:39,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:39,879 INFO L82 PathProgramCache]: Analyzing trace with hash -59603234, now seen corresponding path program 1 times [2019-10-07 13:49:39,879 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:39,879 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:39,880 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:39,880 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:39,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:39,965 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:39,965 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:39,966 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:39,966 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:39,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:39,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:39,967 INFO L87 Difference]: Start difference. First operand 415 states and 542 transitions. Second operand 3 states. [2019-10-07 13:49:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:40,010 INFO L93 Difference]: Finished difference Result 484 states and 628 transitions. [2019-10-07 13:49:40,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:40,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-07 13:49:40,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:40,014 INFO L225 Difference]: With dead ends: 484 [2019-10-07 13:49:40,014 INFO L226 Difference]: Without dead ends: 466 [2019-10-07 13:49:40,015 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:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-07 13:49:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 450. [2019-10-07 13:49:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-07 13:49:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 584 transitions. [2019-10-07 13:49:40,039 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 584 transitions. Word has length 28 [2019-10-07 13:49:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:40,039 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 584 transitions. [2019-10-07 13:49:40,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 584 transitions. [2019-10-07 13:49:40,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-07 13:49:40,041 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:40,042 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:40,042 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:40,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:40,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1687296961, now seen corresponding path program 1 times [2019-10-07 13:49:40,043 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:40,043 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:40,043 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:40,043 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:40,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:40,134 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:40,134 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:40,134 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:40,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:40,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:40,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:40,135 INFO L87 Difference]: Start difference. First operand 450 states and 584 transitions. Second operand 3 states. [2019-10-07 13:49:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:40,221 INFO L93 Difference]: Finished difference Result 459 states and 595 transitions. [2019-10-07 13:49:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:40,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-07 13:49:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:40,224 INFO L225 Difference]: With dead ends: 459 [2019-10-07 13:49:40,225 INFO L226 Difference]: Without dead ends: 456 [2019-10-07 13:49:40,225 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:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-07 13:49:40,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-10-07 13:49:40,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-07 13:49:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 591 transitions. [2019-10-07 13:49:40,247 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 591 transitions. Word has length 32 [2019-10-07 13:49:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:40,248 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 591 transitions. [2019-10-07 13:49:40,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:40,248 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 591 transitions. [2019-10-07 13:49:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-07 13:49:40,250 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:40,250 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:40,251 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1068938519, now seen corresponding path program 1 times [2019-10-07 13:49:40,251 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:40,252 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:40,252 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:40,252 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:40,298 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:40,298 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:40,298 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:40,299 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:40,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:40,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:40,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:40,300 INFO L87 Difference]: Start difference. First operand 456 states and 591 transitions. Second operand 3 states. [2019-10-07 13:49:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:40,404 INFO L93 Difference]: Finished difference Result 605 states and 798 transitions. [2019-10-07 13:49:40,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:40,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-07 13:49:40,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:40,408 INFO L225 Difference]: With dead ends: 605 [2019-10-07 13:49:40,409 INFO L226 Difference]: Without dead ends: 602 [2019-10-07 13:49:40,409 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:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-07 13:49:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 502. [2019-10-07 13:49:40,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-07 13:49:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2019-10-07 13:49:40,437 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 35 [2019-10-07 13:49:40,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:40,437 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2019-10-07 13:49:40,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:40,438 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2019-10-07 13:49:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-07 13:49:40,439 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:40,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] [2019-10-07 13:49:40,439 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:40,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1155855189, now seen corresponding path program 1 times [2019-10-07 13:49:40,464 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:40,464 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:40,464 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:40,464 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:40,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:40,516 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:40,516 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:40,516 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:40,517 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:40,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:40,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:40,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:40,518 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 3 states. [2019-10-07 13:49:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:40,601 INFO L93 Difference]: Finished difference Result 530 states and 687 transitions. [2019-10-07 13:49:40,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:40,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-07 13:49:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:40,604 INFO L225 Difference]: With dead ends: 530 [2019-10-07 13:49:40,605 INFO L226 Difference]: Without dead ends: 525 [2019-10-07 13:49:40,605 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:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-10-07 13:49:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 523. [2019-10-07 13:49:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-07 13:49:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 680 transitions. [2019-10-07 13:49:40,635 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 680 transitions. Word has length 35 [2019-10-07 13:49:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:40,636 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 680 transitions. [2019-10-07 13:49:40,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 680 transitions. [2019-10-07 13:49:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 13:49:40,639 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:40,639 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] [2019-10-07 13:49:40,640 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:40,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:40,640 INFO L82 PathProgramCache]: Analyzing trace with hash 984815367, now seen corresponding path program 1 times [2019-10-07 13:49:40,640 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:40,641 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:40,641 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:40,641 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:40,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:40,775 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:40,776 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:40,776 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:40,776 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:40,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:40,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:40,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:40,777 INFO L87 Difference]: Start difference. First operand 523 states and 680 transitions. Second operand 8 states. [2019-10-07 13:49:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:41,549 INFO L93 Difference]: Finished difference Result 689 states and 894 transitions. [2019-10-07 13:49:41,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:49:41,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-10-07 13:49:41,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:41,556 INFO L225 Difference]: With dead ends: 689 [2019-10-07 13:49:41,556 INFO L226 Difference]: Without dead ends: 620 [2019-10-07 13:49:41,557 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-07 13:49:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 517. [2019-10-07 13:49:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-10-07 13:49:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 666 transitions. [2019-10-07 13:49:41,588 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 666 transitions. Word has length 36 [2019-10-07 13:49:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:41,589 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 666 transitions. [2019-10-07 13:49:41,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 666 transitions. [2019-10-07 13:49:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-07 13:49:41,590 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:41,590 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] [2019-10-07 13:49:41,591 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1019894896, now seen corresponding path program 1 times [2019-10-07 13:49:41,591 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:41,591 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:41,592 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:41,592 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:41,665 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:41,665 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:41,665 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:41,665 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:41,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:41,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:41,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:41,666 INFO L87 Difference]: Start difference. First operand 517 states and 666 transitions. Second operand 8 states. [2019-10-07 13:49:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:42,213 INFO L93 Difference]: Finished difference Result 539 states and 688 transitions. [2019-10-07 13:49:42,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:42,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-10-07 13:49:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:42,218 INFO L225 Difference]: With dead ends: 539 [2019-10-07 13:49:42,218 INFO L226 Difference]: Without dead ends: 533 [2019-10-07 13:49:42,219 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:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-07 13:49:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 517. [2019-10-07 13:49:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-10-07 13:49:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 665 transitions. [2019-10-07 13:49:42,274 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 665 transitions. Word has length 36 [2019-10-07 13:49:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:42,274 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 665 transitions. [2019-10-07 13:49:42,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 665 transitions. [2019-10-07 13:49:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 13:49:42,275 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:42,276 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:42,276 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1882604984, now seen corresponding path program 1 times [2019-10-07 13:49:42,277 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:42,277 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:42,277 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:42,277 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:42,346 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:42,346 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:42,346 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:42,347 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:42,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:42,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:42,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:42,348 INFO L87 Difference]: Start difference. First operand 517 states and 665 transitions. Second operand 8 states. [2019-10-07 13:49:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:42,907 INFO L93 Difference]: Finished difference Result 539 states and 686 transitions. [2019-10-07 13:49:42,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:42,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-10-07 13:49:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:42,912 INFO L225 Difference]: With dead ends: 539 [2019-10-07 13:49:42,912 INFO L226 Difference]: Without dead ends: 533 [2019-10-07 13:49:42,913 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:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-07 13:49:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 517. [2019-10-07 13:49:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-10-07 13:49:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 664 transitions. [2019-10-07 13:49:42,944 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 664 transitions. Word has length 37 [2019-10-07 13:49:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:42,944 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 664 transitions. [2019-10-07 13:49:42,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 664 transitions. [2019-10-07 13:49:42,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-07 13:49:42,946 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:42,946 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:42,946 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:42,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:42,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1685011911, now seen corresponding path program 1 times [2019-10-07 13:49:42,947 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:42,947 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:42,947 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:42,947 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:43,014 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:43,015 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:43,015 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:43,015 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:43,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:43,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:43,016 INFO L87 Difference]: Start difference. First operand 517 states and 664 transitions. Second operand 5 states. [2019-10-07 13:49:43,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:43,061 INFO L93 Difference]: Finished difference Result 533 states and 679 transitions. [2019-10-07 13:49:43,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:43,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-07 13:49:43,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:43,065 INFO L225 Difference]: With dead ends: 533 [2019-10-07 13:49:43,065 INFO L226 Difference]: Without dead ends: 515 [2019-10-07 13:49:43,067 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:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-10-07 13:49:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-10-07 13:49:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-10-07 13:49:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 660 transitions. [2019-10-07 13:49:43,107 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 660 transitions. Word has length 38 [2019-10-07 13:49:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:43,108 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 660 transitions. [2019-10-07 13:49:43,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 660 transitions. [2019-10-07 13:49:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 13:49:43,111 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:43,111 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:43,111 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:43,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:43,112 INFO L82 PathProgramCache]: Analyzing trace with hash 772670357, now seen corresponding path program 1 times [2019-10-07 13:49:43,112 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:43,112 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:43,112 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:43,112 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:43,195 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:43,195 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:43,195 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:43,195 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:49:43,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:49:43,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:49:43,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:49:43,196 INFO L87 Difference]: Start difference. First operand 515 states and 660 transitions. Second operand 4 states. [2019-10-07 13:49:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:43,353 INFO L93 Difference]: Finished difference Result 565 states and 704 transitions. [2019-10-07 13:49:43,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:49:43,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-10-07 13:49:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:43,356 INFO L225 Difference]: With dead ends: 565 [2019-10-07 13:49:43,356 INFO L226 Difference]: Without dead ends: 376 [2019-10-07 13:49:43,357 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:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-07 13:49:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 357. [2019-10-07 13:49:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-07 13:49:43,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 436 transitions. [2019-10-07 13:49:43,377 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 436 transitions. Word has length 40 [2019-10-07 13:49:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:43,378 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 436 transitions. [2019-10-07 13:49:43,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:49:43,378 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 436 transitions. [2019-10-07 13:49:43,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 13:49:43,379 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:43,379 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] [2019-10-07 13:49:43,379 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:43,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:43,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1299782882, now seen corresponding path program 1 times [2019-10-07 13:49:43,380 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:43,380 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:43,381 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:43,381 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:43,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:43,421 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:43,422 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:43,422 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:43,422 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:43,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:43,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:43,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:43,423 INFO L87 Difference]: Start difference. First operand 357 states and 436 transitions. Second operand 3 states. [2019-10-07 13:49:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:43,483 INFO L93 Difference]: Finished difference Result 538 states and 668 transitions. [2019-10-07 13:49:43,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:43,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-07 13:49:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:43,486 INFO L225 Difference]: With dead ends: 538 [2019-10-07 13:49:43,486 INFO L226 Difference]: Without dead ends: 360 [2019-10-07 13:49:43,486 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:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-10-07 13:49:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-10-07 13:49:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-07 13:49:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 440 transitions. [2019-10-07 13:49:43,505 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 440 transitions. Word has length 48 [2019-10-07 13:49:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:43,505 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 440 transitions. [2019-10-07 13:49:43,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 440 transitions. [2019-10-07 13:49:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:49:43,507 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:43,507 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:43,507 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:43,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1887771739, now seen corresponding path program 1 times [2019-10-07 13:49:43,508 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:43,508 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:43,508 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:43,508 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:43,659 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:43,659 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:43,660 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:43,660 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:43,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:43,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:43,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:43,661 INFO L87 Difference]: Start difference. First operand 360 states and 440 transitions. Second operand 5 states. [2019-10-07 13:49:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:43,695 INFO L93 Difference]: Finished difference Result 534 states and 661 transitions. [2019-10-07 13:49:43,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:43,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-07 13:49:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:43,698 INFO L225 Difference]: With dead ends: 534 [2019-10-07 13:49:43,698 INFO L226 Difference]: Without dead ends: 353 [2019-10-07 13:49:43,699 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:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-10-07 13:49:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2019-10-07 13:49:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-10-07 13:49:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 428 transitions. [2019-10-07 13:49:43,721 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 428 transitions. Word has length 50 [2019-10-07 13:49:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:43,722 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 428 transitions. [2019-10-07 13:49:43,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 428 transitions. [2019-10-07 13:49:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-07 13:49:43,723 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:43,723 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:43,723 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash -445964506, now seen corresponding path program 1 times [2019-10-07 13:49:43,724 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:43,724 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:43,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:43,724 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:43,768 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:43,768 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:43,768 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:43,769 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:43,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:43,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:43,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:43,770 INFO L87 Difference]: Start difference. First operand 353 states and 428 transitions. Second operand 3 states. [2019-10-07 13:49:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:43,865 INFO L93 Difference]: Finished difference Result 493 states and 614 transitions. [2019-10-07 13:49:43,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:43,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-07 13:49:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:43,868 INFO L225 Difference]: With dead ends: 493 [2019-10-07 13:49:43,868 INFO L226 Difference]: Without dead ends: 485 [2019-10-07 13:49:43,871 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:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-07 13:49:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 393. [2019-10-07 13:49:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-10-07 13:49:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 478 transitions. [2019-10-07 13:49:43,905 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 478 transitions. Word has length 43 [2019-10-07 13:49:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:43,906 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 478 transitions. [2019-10-07 13:49:43,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 478 transitions. [2019-10-07 13:49:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:49:43,908 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:43,908 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:43,908 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:43,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash -488120203, now seen corresponding path program 1 times [2019-10-07 13:49:43,909 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:43,909 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:43,909 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:43,910 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:43,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:44,075 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:44,075 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:44,075 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:44,076 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:49:44,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:49:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:49:44,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:49:44,077 INFO L87 Difference]: Start difference. First operand 393 states and 478 transitions. Second operand 10 states. [2019-10-07 13:49:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:45,287 INFO L93 Difference]: Finished difference Result 439 states and 530 transitions. [2019-10-07 13:49:45,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 13:49:45,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-10-07 13:49:45,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:45,291 INFO L225 Difference]: With dead ends: 439 [2019-10-07 13:49:45,291 INFO L226 Difference]: Without dead ends: 435 [2019-10-07 13:49:45,291 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:45,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-07 13:49:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-10-07 13:49:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-10-07 13:49:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 523 transitions. [2019-10-07 13:49:45,323 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 523 transitions. Word has length 44 [2019-10-07 13:49:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:45,323 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 523 transitions. [2019-10-07 13:49:45,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:49:45,324 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 523 transitions. [2019-10-07 13:49:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:49:45,325 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:45,325 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:45,325 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash -487843373, now seen corresponding path program 1 times [2019-10-07 13:49:45,326 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:45,326 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:45,326 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:45,326 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:49:45,419 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:45,419 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:45,419 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:45,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:45,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:45,420 INFO L87 Difference]: Start difference. First operand 431 states and 523 transitions. Second operand 8 states. [2019-10-07 13:49:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:45,571 INFO L93 Difference]: Finished difference Result 463 states and 559 transitions. [2019-10-07 13:49:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:45,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-07 13:49:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:45,574 INFO L225 Difference]: With dead ends: 463 [2019-10-07 13:49:45,575 INFO L226 Difference]: Without dead ends: 447 [2019-10-07 13:49:45,575 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:45,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-07 13:49:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 439. [2019-10-07 13:49:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-07 13:49:45,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 532 transitions. [2019-10-07 13:49:45,602 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 532 transitions. Word has length 44 [2019-10-07 13:49:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:45,603 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 532 transitions. [2019-10-07 13:49:45,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 532 transitions. [2019-10-07 13:49:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 13:49:45,604 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:45,604 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:45,605 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:45,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:45,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1717538634, now seen corresponding path program 1 times [2019-10-07 13:49:45,605 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:45,605 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:45,605 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:45,606 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:45,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:45,663 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:45,664 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:45,664 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:45,664 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:49:45,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:49:45,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:49:45,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:45,665 INFO L87 Difference]: Start difference. First operand 439 states and 532 transitions. Second operand 7 states. [2019-10-07 13:49:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:46,223 INFO L93 Difference]: Finished difference Result 500 states and 609 transitions. [2019-10-07 13:49:46,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:46,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-10-07 13:49:46,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:46,227 INFO L225 Difference]: With dead ends: 500 [2019-10-07 13:49:46,227 INFO L226 Difference]: Without dead ends: 439 [2019-10-07 13:49:46,227 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:49:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-10-07 13:49:46,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-10-07 13:49:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-07 13:49:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 530 transitions. [2019-10-07 13:49:46,257 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 530 transitions. Word has length 44 [2019-10-07 13:49:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:46,258 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 530 transitions. [2019-10-07 13:49:46,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:49:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 530 transitions. [2019-10-07 13:49:46,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-07 13:49:46,259 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:46,259 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:46,259 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:46,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:46,260 INFO L82 PathProgramCache]: Analyzing trace with hash 462464929, now seen corresponding path program 1 times [2019-10-07 13:49:46,260 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:46,260 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:46,260 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:46,260 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:46,295 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:46,296 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:46,296 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:46,296 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:46,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:46,297 INFO L87 Difference]: Start difference. First operand 439 states and 530 transitions. Second operand 3 states. [2019-10-07 13:49:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:46,366 INFO L93 Difference]: Finished difference Result 461 states and 552 transitions. [2019-10-07 13:49:46,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:46,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-07 13:49:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:46,369 INFO L225 Difference]: With dead ends: 461 [2019-10-07 13:49:46,370 INFO L226 Difference]: Without dead ends: 447 [2019-10-07 13:49:46,370 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:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-07 13:49:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 435. [2019-10-07 13:49:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-07 13:49:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 521 transitions. [2019-10-07 13:49:46,401 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 521 transitions. Word has length 45 [2019-10-07 13:49:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:46,401 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 521 transitions. [2019-10-07 13:49:46,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:46,401 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 521 transitions. [2019-10-07 13:49:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-07 13:49:46,402 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:46,403 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:49:46,403 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1389938668, now seen corresponding path program 1 times [2019-10-07 13:49:46,403 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:46,403 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:46,404 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:46,404 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:46,485 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:46,513 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:46,513 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:46,513 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:46,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:46,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:46,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:46,514 INFO L87 Difference]: Start difference. First operand 435 states and 521 transitions. Second operand 5 states. [2019-10-07 13:49:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:46,766 INFO L93 Difference]: Finished difference Result 613 states and 744 transitions. [2019-10-07 13:49:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:46,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-07 13:49:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:46,769 INFO L225 Difference]: With dead ends: 613 [2019-10-07 13:49:46,770 INFO L226 Difference]: Without dead ends: 435 [2019-10-07 13:49:46,770 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:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-07 13:49:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-10-07 13:49:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-07 13:49:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 520 transitions. [2019-10-07 13:49:46,800 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 520 transitions. Word has length 54 [2019-10-07 13:49:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:46,801 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 520 transitions. [2019-10-07 13:49:46,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 520 transitions. [2019-10-07 13:49:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-07 13:49:46,802 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:46,802 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:46,803 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:46,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:46,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1903388506, now seen corresponding path program 1 times [2019-10-07 13:49:46,803 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:46,803 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:46,804 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:46,804 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:46,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:46,854 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:46,854 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:46,854 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:46,855 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:46,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:46,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:46,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:46,856 INFO L87 Difference]: Start difference. First operand 435 states and 520 transitions. Second operand 5 states. [2019-10-07 13:49:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:47,162 INFO L93 Difference]: Finished difference Result 449 states and 533 transitions. [2019-10-07 13:49:47,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:47,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-07 13:49:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:47,165 INFO L225 Difference]: With dead ends: 449 [2019-10-07 13:49:47,165 INFO L226 Difference]: Without dead ends: 431 [2019-10-07 13:49:47,165 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:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-07 13:49:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2019-10-07 13:49:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-07 13:49:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 506 transitions. [2019-10-07 13:49:47,196 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 506 transitions. Word has length 46 [2019-10-07 13:49:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:47,196 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 506 transitions. [2019-10-07 13:49:47,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 506 transitions. [2019-10-07 13:49:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-07 13:49:47,201 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:47,201 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] [2019-10-07 13:49:47,201 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash -234491934, now seen corresponding path program 1 times [2019-10-07 13:49:47,202 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:47,202 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:47,202 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:47,202 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:47,287 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,287 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:47,288 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:47,288 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:49:47,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:49:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:49:47,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:47,289 INFO L87 Difference]: Start difference. First operand 423 states and 506 transitions. Second operand 7 states. [2019-10-07 13:49:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:47,689 INFO L93 Difference]: Finished difference Result 430 states and 514 transitions. [2019-10-07 13:49:47,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:49:47,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-07 13:49:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:47,694 INFO L225 Difference]: With dead ends: 430 [2019-10-07 13:49:47,694 INFO L226 Difference]: Without dead ends: 427 [2019-10-07 13:49:47,695 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-07 13:49:47,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-10-07 13:49:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-07 13:49:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 506 transitions. [2019-10-07 13:49:47,729 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 506 transitions. Word has length 55 [2019-10-07 13:49:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:47,729 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 506 transitions. [2019-10-07 13:49:47,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:49:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 506 transitions. [2019-10-07 13:49:47,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:49:47,731 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:47,731 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:47,731 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:47,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:47,731 INFO L82 PathProgramCache]: Analyzing trace with hash 163990782, now seen corresponding path program 1 times [2019-10-07 13:49:47,732 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:47,732 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:47,732 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:47,732 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:47,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:47,808 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,809 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:47,809 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:47,809 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:47,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:47,810 INFO L87 Difference]: Start difference. First operand 423 states and 506 transitions. Second operand 9 states. [2019-10-07 13:49:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:47,978 INFO L93 Difference]: Finished difference Result 448 states and 531 transitions. [2019-10-07 13:49:47,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:47,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-10-07 13:49:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:47,980 INFO L225 Difference]: With dead ends: 448 [2019-10-07 13:49:47,981 INFO L226 Difference]: Without dead ends: 418 [2019-10-07 13:49:47,981 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:47,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-07 13:49:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2019-10-07 13:49:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-10-07 13:49:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 498 transitions. [2019-10-07 13:49:48,006 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 498 transitions. Word has length 47 [2019-10-07 13:49:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:48,006 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 498 transitions. [2019-10-07 13:49:48,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 498 transitions. [2019-10-07 13:49:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 13:49:48,008 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:48,008 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:48,008 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:48,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1254376986, now seen corresponding path program 1 times [2019-10-07 13:49:48,009 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:48,009 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,009 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,009 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:48,074 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,075 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,075 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:48,075 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:48,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:48,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:48,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:48,076 INFO L87 Difference]: Start difference. First operand 418 states and 498 transitions. Second operand 9 states. [2019-10-07 13:49:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:48,305 INFO L93 Difference]: Finished difference Result 443 states and 523 transitions. [2019-10-07 13:49:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:48,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-10-07 13:49:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:48,309 INFO L225 Difference]: With dead ends: 443 [2019-10-07 13:49:48,309 INFO L226 Difference]: Without dead ends: 413 [2019-10-07 13:49:48,310 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:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-07 13:49:48,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2019-10-07 13:49:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-10-07 13:49:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 490 transitions. [2019-10-07 13:49:48,345 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 490 transitions. Word has length 47 [2019-10-07 13:49:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:48,345 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 490 transitions. [2019-10-07 13:49:48,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 490 transitions. [2019-10-07 13:49:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 13:49:48,348 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:48,348 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] [2019-10-07 13:49:48,348 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1889673940, now seen corresponding path program 1 times [2019-10-07 13:49:48,349 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:48,349 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,349 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,350 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:48,413 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,413 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,414 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:48,414 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:49:48,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:49:48,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:49:48,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:49:48,415 INFO L87 Difference]: Start difference. First operand 413 states and 490 transitions. Second operand 6 states. [2019-10-07 13:49:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:48,485 INFO L93 Difference]: Finished difference Result 430 states and 506 transitions. [2019-10-07 13:49:48,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:49:48,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-07 13:49:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:48,488 INFO L225 Difference]: With dead ends: 430 [2019-10-07 13:49:48,488 INFO L226 Difference]: Without dead ends: 395 [2019-10-07 13:49:48,488 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:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-07 13:49:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2019-10-07 13:49:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-07 13:49:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 468 transitions. [2019-10-07 13:49:48,513 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 468 transitions. Word has length 49 [2019-10-07 13:49:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:48,513 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 468 transitions. [2019-10-07 13:49:48,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:49:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 468 transitions. [2019-10-07 13:49:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 13:49:48,515 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:48,515 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] [2019-10-07 13:49:48,515 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:48,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:48,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1075527803, now seen corresponding path program 1 times [2019-10-07 13:49:48,516 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:48,516 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,516 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,516 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:48,583 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,583 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,583 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:48,583 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:48,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:48,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:48,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:48,585 INFO L87 Difference]: Start difference. First operand 395 states and 468 transitions. Second operand 9 states. [2019-10-07 13:49:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:48,745 INFO L93 Difference]: Finished difference Result 420 states and 493 transitions. [2019-10-07 13:49:48,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:48,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-10-07 13:49:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:48,749 INFO L225 Difference]: With dead ends: 420 [2019-10-07 13:49:48,749 INFO L226 Difference]: Without dead ends: 390 [2019-10-07 13:49:48,750 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:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-10-07 13:49:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2019-10-07 13:49:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-10-07 13:49:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 460 transitions. [2019-10-07 13:49:48,778 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 460 transitions. Word has length 48 [2019-10-07 13:49:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:48,778 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 460 transitions. [2019-10-07 13:49:48,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 460 transitions. [2019-10-07 13:49:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-07 13:49:48,779 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:48,779 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:48,780 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:48,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:48,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1669746933, now seen corresponding path program 1 times [2019-10-07 13:49:48,780 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:48,780 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,780 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,781 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:48,838 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,838 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,839 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:48,839 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:49:48,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:49:48,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:49:48,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:49:48,840 INFO L87 Difference]: Start difference. First operand 390 states and 460 transitions. Second operand 3 states. [2019-10-07 13:49:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:48,901 INFO L93 Difference]: Finished difference Result 639 states and 766 transitions. [2019-10-07 13:49:48,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:49:48,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-07 13:49:48,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:48,904 INFO L225 Difference]: With dead ends: 639 [2019-10-07 13:49:48,904 INFO L226 Difference]: Without dead ends: 467 [2019-10-07 13:49:48,905 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,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-07 13:49:48,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 440. [2019-10-07 13:49:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-07 13:49:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 522 transitions. [2019-10-07 13:49:48,936 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 522 transitions. Word has length 57 [2019-10-07 13:49:48,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:48,937 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 522 transitions. [2019-10-07 13:49:48,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:49:48,937 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 522 transitions. [2019-10-07 13:49:48,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:49:48,938 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:48,938 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:48,939 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:48,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:48,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1369679451, now seen corresponding path program 1 times [2019-10-07 13:49:48,939 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:48,939 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:48,940 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,940 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:48,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:49,023 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,024 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:49,024 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:49,024 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:49,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:49,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:49,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:49,025 INFO L87 Difference]: Start difference. First operand 440 states and 522 transitions. Second operand 9 states. [2019-10-07 13:49:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:49,185 INFO L93 Difference]: Finished difference Result 465 states and 547 transitions. [2019-10-07 13:49:49,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:49,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-07 13:49:49,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:49,188 INFO L225 Difference]: With dead ends: 465 [2019-10-07 13:49:49,188 INFO L226 Difference]: Without dead ends: 411 [2019-10-07 13:49:49,188 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:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-07 13:49:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2019-10-07 13:49:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-07 13:49:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 486 transitions. [2019-10-07 13:49:49,214 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 486 transitions. Word has length 51 [2019-10-07 13:49:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:49,214 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 486 transitions. [2019-10-07 13:49:49,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 486 transitions. [2019-10-07 13:49:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-07 13:49:49,215 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:49,215 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:49:49,216 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:49,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash -685045101, now seen corresponding path program 1 times [2019-10-07 13:49:49,216 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:49,216 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:49,216 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:49,217 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:49,299 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,299 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:49,299 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:49,299 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:49,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:49,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:49,300 INFO L87 Difference]: Start difference. First operand 411 states and 486 transitions. Second operand 9 states. [2019-10-07 13:49:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:49,911 INFO L93 Difference]: Finished difference Result 445 states and 520 transitions. [2019-10-07 13:49:49,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:49,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-07 13:49:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:49,914 INFO L225 Difference]: With dead ends: 445 [2019-10-07 13:49:49,914 INFO L226 Difference]: Without dead ends: 409 [2019-10-07 13:49:49,915 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:49:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-07 13:49:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-07 13:49:49,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-07 13:49:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 481 transitions. [2019-10-07 13:49:49,941 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 481 transitions. Word has length 63 [2019-10-07 13:49:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:49,941 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 481 transitions. [2019-10-07 13:49:49,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 481 transitions. [2019-10-07 13:49:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-07 13:49:49,943 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:49,943 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] [2019-10-07 13:49:49,943 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:49,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1281989941, now seen corresponding path program 1 times [2019-10-07 13:49:49,944 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:49,944 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:49,944 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:49,944 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:49,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:50,023 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,024 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:50,024 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:50,024 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 13:49:50,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:49:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:49:50,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:50,025 INFO L87 Difference]: Start difference. First operand 409 states and 481 transitions. Second operand 8 states. [2019-10-07 13:49:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:50,533 INFO L93 Difference]: Finished difference Result 491 states and 590 transitions. [2019-10-07 13:49:50,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:50,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-10-07 13:49:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:50,536 INFO L225 Difference]: With dead ends: 491 [2019-10-07 13:49:50,536 INFO L226 Difference]: Without dead ends: 487 [2019-10-07 13:49:50,537 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:49:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-07 13:49:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 409. [2019-10-07 13:49:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-07 13:49:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 481 transitions. [2019-10-07 13:49:50,565 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 481 transitions. Word has length 64 [2019-10-07 13:49:50,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:50,565 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 481 transitions. [2019-10-07 13:49:50,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:49:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 481 transitions. [2019-10-07 13:49:50,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-07 13:49:50,566 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:50,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, 1, 1, 1, 1, 1, 1] [2019-10-07 13:49:50,567 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:50,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1003050700, now seen corresponding path program 1 times [2019-10-07 13:49:50,567 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:50,568 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:50,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:50,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:50,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:50,615 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,615 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:50,615 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:50,615 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:50,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:50,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:50,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:50,617 INFO L87 Difference]: Start difference. First operand 409 states and 481 transitions. Second operand 5 states. [2019-10-07 13:49:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:50,924 INFO L93 Difference]: Finished difference Result 713 states and 815 transitions. [2019-10-07 13:49:50,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:49:50,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-07 13:49:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:50,927 INFO L225 Difference]: With dead ends: 713 [2019-10-07 13:49:50,927 INFO L226 Difference]: Without dead ends: 460 [2019-10-07 13:49:50,928 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:49:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-10-07 13:49:50,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 440. [2019-10-07 13:49:50,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-07 13:49:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 505 transitions. [2019-10-07 13:49:50,957 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 505 transitions. Word has length 59 [2019-10-07 13:49:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:50,957 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 505 transitions. [2019-10-07 13:49:50,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 505 transitions. [2019-10-07 13:49:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:49:50,959 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:50,959 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] [2019-10-07 13:49:50,959 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1173670243, now seen corresponding path program 1 times [2019-10-07 13:49:50,960 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:50,960 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:50,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:50,960 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:50,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:51,028 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,028 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:51,028 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:51,028 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:51,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:51,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:51,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:51,029 INFO L87 Difference]: Start difference. First operand 440 states and 505 transitions. Second operand 9 states. [2019-10-07 13:49:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:51,168 INFO L93 Difference]: Finished difference Result 442 states and 506 transitions. [2019-10-07 13:49:51,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:51,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-10-07 13:49:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:51,170 INFO L225 Difference]: With dead ends: 442 [2019-10-07 13:49:51,170 INFO L226 Difference]: Without dead ends: 325 [2019-10-07 13:49:51,171 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:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-07 13:49:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-10-07 13:49:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-10-07 13:49:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 377 transitions. [2019-10-07 13:49:51,197 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 377 transitions. Word has length 60 [2019-10-07 13:49:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:51,197 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 377 transitions. [2019-10-07 13:49:51,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 377 transitions. [2019-10-07 13:49:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-07 13:49:51,198 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:51,199 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] [2019-10-07 13:49:51,199 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:51,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1733141653, now seen corresponding path program 1 times [2019-10-07 13:49:51,199 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:51,200 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:51,200 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:51,200 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:51,256 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,257 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:51,257 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:51,257 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:49:51,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:49:51,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:49:51,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:51,258 INFO L87 Difference]: Start difference. First operand 325 states and 377 transitions. Second operand 7 states. [2019-10-07 13:49:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:51,347 INFO L93 Difference]: Finished difference Result 342 states and 393 transitions. [2019-10-07 13:49:51,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:49:51,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-10-07 13:49:51,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:51,350 INFO L225 Difference]: With dead ends: 342 [2019-10-07 13:49:51,350 INFO L226 Difference]: Without dead ends: 323 [2019-10-07 13:49:51,350 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:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-07 13:49:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 284. [2019-10-07 13:49:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-07 13:49:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 325 transitions. [2019-10-07 13:49:51,374 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 325 transitions. Word has length 71 [2019-10-07 13:49:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:51,374 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 325 transitions. [2019-10-07 13:49:51,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:49:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 325 transitions. [2019-10-07 13:49:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-07 13:49:51,376 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:51,376 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] [2019-10-07 13:49:51,376 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:51,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:51,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1012836717, now seen corresponding path program 1 times [2019-10-07 13:49:51,377 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:51,377 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:51,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:51,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:51,474 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,474 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:51,474 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:51,475 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:51,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:51,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:51,476 INFO L87 Difference]: Start difference. First operand 284 states and 325 transitions. Second operand 9 states. [2019-10-07 13:49:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:51,921 INFO L93 Difference]: Finished difference Result 400 states and 454 transitions. [2019-10-07 13:49:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:51,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-10-07 13:49:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:51,924 INFO L225 Difference]: With dead ends: 400 [2019-10-07 13:49:51,924 INFO L226 Difference]: Without dead ends: 256 [2019-10-07 13:49:51,925 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:49:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-07 13:49:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2019-10-07 13:49:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-07 13:49:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 286 transitions. [2019-10-07 13:49:51,944 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 286 transitions. Word has length 72 [2019-10-07 13:49:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:51,945 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 286 transitions. [2019-10-07 13:49:51,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 286 transitions. [2019-10-07 13:49:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-07 13:49:51,946 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:51,946 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] [2019-10-07 13:49:51,946 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:51,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash -392261068, now seen corresponding path program 1 times [2019-10-07 13:49:51,947 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:51,947 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:51,947 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:51,947 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:51,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:52,044 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,045 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,045 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:52,045 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-07 13:49:52,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-07 13:49:52,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-07 13:49:52,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:49:52,046 INFO L87 Difference]: Start difference. First operand 252 states and 286 transitions. Second operand 10 states. [2019-10-07 13:49:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:52,267 INFO L93 Difference]: Finished difference Result 294 states and 325 transitions. [2019-10-07 13:49:52,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 13:49:52,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-07 13:49:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:52,269 INFO L225 Difference]: With dead ends: 294 [2019-10-07 13:49:52,269 INFO L226 Difference]: Without dead ends: 232 [2019-10-07 13:49:52,269 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-10-07 13:49:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-07 13:49:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-10-07 13:49:52,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-07 13:49:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 262 transitions. [2019-10-07 13:49:52,288 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 262 transitions. Word has length 78 [2019-10-07 13:49:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:52,288 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 262 transitions. [2019-10-07 13:49:52,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-07 13:49:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 262 transitions. [2019-10-07 13:49:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-07 13:49:52,289 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 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,290 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:52,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:52,290 INFO L82 PathProgramCache]: Analyzing trace with hash 220424145, now seen corresponding path program 1 times [2019-10-07 13:49:52,290 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:52,290 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,291 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,291 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:52,452 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,453 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,453 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:52,453 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:52,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:52,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:52,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:52,455 INFO L87 Difference]: Start difference. First operand 232 states and 262 transitions. Second operand 11 states. [2019-10-07 13:49:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:52,567 INFO L93 Difference]: Finished difference Result 310 states and 347 transitions. [2019-10-07 13:49:52,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:52,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-10-07 13:49:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:52,569 INFO L225 Difference]: With dead ends: 310 [2019-10-07 13:49:52,569 INFO L226 Difference]: Without dead ends: 197 [2019-10-07 13:49:52,569 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-07 13:49:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2019-10-07 13:49:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-07 13:49:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 207 transitions. [2019-10-07 13:49:52,585 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 207 transitions. Word has length 83 [2019-10-07 13:49:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:52,585 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 207 transitions. [2019-10-07 13:49:52,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 207 transitions. [2019-10-07 13:49:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-07 13:49:52,586 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:52,586 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] [2019-10-07 13:49:52,587 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:52,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1811313841, now seen corresponding path program 1 times [2019-10-07 13:49:52,587 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:52,587 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,587 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,588 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:52,673 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:49:52,674 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,674 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:52,674 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:49:52,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:49:52,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:49:52,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:49:52,677 INFO L87 Difference]: Start difference. First operand 189 states and 207 transitions. Second operand 7 states. [2019-10-07 13:49:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:52,872 INFO L93 Difference]: Finished difference Result 248 states and 279 transitions. [2019-10-07 13:49:52,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:49:52,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-10-07 13:49:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:52,874 INFO L225 Difference]: With dead ends: 248 [2019-10-07 13:49:52,874 INFO L226 Difference]: Without dead ends: 245 [2019-10-07 13:49:52,875 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:49:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-07 13:49:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 223. [2019-10-07 13:49:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-07 13:49:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2019-10-07 13:49:52,894 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 88 [2019-10-07 13:49:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:52,895 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2019-10-07 13:49:52,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:49:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2019-10-07 13:49:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-07 13:49:52,896 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:52,898 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] [2019-10-07 13:49:52,898 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:52,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:52,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1150229932, now seen corresponding path program 1 times [2019-10-07 13:49:52,898 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:52,899 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,899 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,899 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:52,966 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:49:52,966 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:52,966 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:52,967 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:52,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:52,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:52,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:52,968 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand 5 states. [2019-10-07 13:49:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:53,292 INFO L93 Difference]: Finished difference Result 304 states and 334 transitions. [2019-10-07 13:49:53,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:49:53,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-10-07 13:49:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:53,295 INFO L225 Difference]: With dead ends: 304 [2019-10-07 13:49:53,295 INFO L226 Difference]: Without dead ends: 243 [2019-10-07 13:49:53,296 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:49:53,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-07 13:49:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 148. [2019-10-07 13:49:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-07 13:49:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2019-10-07 13:49:53,321 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 96 [2019-10-07 13:49:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:53,322 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2019-10-07 13:49:53,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2019-10-07 13:49:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-07 13:49:53,324 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:53,324 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] [2019-10-07 13:49:53,324 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:53,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:53,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1822011349, now seen corresponding path program 1 times [2019-10-07 13:49:53,330 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:53,330 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:53,330 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:53,331 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:53,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:53,552 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:49:53,552 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:53,553 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:53,553 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-07 13:49:53,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-07 13:49:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-07 13:49:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-07 13:49:53,555 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand 13 states. [2019-10-07 13:49:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:53,852 INFO L93 Difference]: Finished difference Result 191 states and 210 transitions. [2019-10-07 13:49:53,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 13:49:53,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2019-10-07 13:49:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:53,854 INFO L225 Difference]: With dead ends: 191 [2019-10-07 13:49:53,854 INFO L226 Difference]: Without dead ends: 162 [2019-10-07 13:49:53,855 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:49:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-07 13:49:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2019-10-07 13:49:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-07 13:49:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2019-10-07 13:49:53,870 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 107 [2019-10-07 13:49:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:53,870 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2019-10-07 13:49:53,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-07 13:49:53,870 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2019-10-07 13:49:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-07 13:49:53,872 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:53,872 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] [2019-10-07 13:49:53,873 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:53,873 INFO L82 PathProgramCache]: Analyzing trace with hash -949307777, now seen corresponding path program 1 times [2019-10-07 13:49:53,873 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:53,873 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:53,874 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:53,874 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:54,018 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:49:54,018 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:54,018 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:54,018 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-07 13:49:54,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 13:49:54,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 13:49:54,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:54,022 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 11 states. [2019-10-07 13:49:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:54,146 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2019-10-07 13:49:54,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 13:49:54,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 120 [2019-10-07 13:49:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:54,147 INFO L225 Difference]: With dead ends: 187 [2019-10-07 13:49:54,147 INFO L226 Difference]: Without dead ends: 154 [2019-10-07 13:49:54,148 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:49:54,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-07 13:49:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-10-07 13:49:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-07 13:49:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2019-10-07 13:49:54,166 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 120 [2019-10-07 13:49:54,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:54,167 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2019-10-07 13:49:54,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 13:49:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2019-10-07 13:49:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-07 13:49:54,168 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:54,169 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:49:54,169 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:54,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1669499445, now seen corresponding path program 1 times [2019-10-07 13:49:54,169 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:54,170 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:54,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:54,170 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:54,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:54,284 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:49:54,284 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:54,285 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:54,285 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:49:54,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:49:54,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:49:54,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:49:54,286 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 5 states. [2019-10-07 13:49:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:54,403 INFO L93 Difference]: Finished difference Result 193 states and 200 transitions. [2019-10-07 13:49:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:49:54,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-10-07 13:49:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:54,405 INFO L225 Difference]: With dead ends: 193 [2019-10-07 13:49:54,406 INFO L226 Difference]: Without dead ends: 139 [2019-10-07 13:49:54,406 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:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-07 13:49:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-10-07 13:49:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-07 13:49:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2019-10-07 13:49:54,428 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 123 [2019-10-07 13:49:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:54,428 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2019-10-07 13:49:54,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:49:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2019-10-07 13:49:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-07 13:49:54,433 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:54,433 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] [2019-10-07 13:49:54,434 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:54,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:54,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1614696425, now seen corresponding path program 1 times [2019-10-07 13:49:54,435 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:54,435 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:54,435 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:54,435 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:54,598 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:49:54,599 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:54,599 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:54,599 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:49:54,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:49:54,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:49:54,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:49:54,601 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 9 states. [2019-10-07 13:49:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:54,925 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2019-10-07 13:49:54,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:49:54,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-10-07 13:49:54,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:54,928 INFO L225 Difference]: With dead ends: 189 [2019-10-07 13:49:54,928 INFO L226 Difference]: Without dead ends: 138 [2019-10-07 13:49:54,928 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-07 13:49:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-07 13:49:54,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-10-07 13:49:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-07 13:49:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-10-07 13:49:54,949 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 125 [2019-10-07 13:49:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:54,950 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-10-07 13:49:54,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:49:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-10-07 13:49:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-07 13:49:54,952 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:49:54,953 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] [2019-10-07 13:49:54,953 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:49:54,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:49:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash 618335336, now seen corresponding path program 1 times [2019-10-07 13:49:54,954 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:49:54,954 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:54,955 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:54,955 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:49:54,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:49:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:49:55,288 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:49:55,288 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:49:55,288 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:49:55,289 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-07 13:49:55,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-07 13:49:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-07 13:49:55,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-07 13:49:55,291 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 14 states. [2019-10-07 13:49:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:49:56,255 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2019-10-07 13:49:56,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-07 13:49:56,256 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 125 [2019-10-07 13:49:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:49:56,256 INFO L225 Difference]: With dead ends: 141 [2019-10-07 13:49:56,257 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:49:56,257 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 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:49:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:49:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:49:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:49:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:49:56,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2019-10-07 13:49:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:49:56,259 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:49:56,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-07 13:49:56,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:49:56,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:49:56,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:49:57,585 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-10-07 13:49:57,739 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-10-07 13:49:58,222 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 86 [2019-10-07 13:49:58,705 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 51 [2019-10-07 13:49:58,933 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-10-07 13:49:59,241 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2019-10-07 13:49:59,561 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-10-07 13:49:59,973 WARN L191 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2019-10-07 13:50:00,129 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 1 [2019-10-07 13:50:00,490 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-10-07 13:50:00,637 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-10-07 13:50:00,862 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-10-07 13:50:01,113 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2019-10-07 13:50:01,303 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-07 13:50:01,469 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 1 [2019-10-07 13:50:01,880 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2019-10-07 13:50:02,383 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 74 [2019-10-07 13:50:02,883 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2019-10-07 13:50:03,497 WARN L191 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 91 [2019-10-07 13:50:03,651 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-07 13:50:03,977 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-10-07 13:50:04,092 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-10-07 13:50:04,316 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 69 [2019-10-07 13:50:04,476 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-10-07 13:50:04,703 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 70 [2019-10-07 13:50:04,987 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-10-07 13:50:05,137 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-10-07 13:50:05,694 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 84 [2019-10-07 13:50:05,933 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-10-07 13:50:06,128 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 66 [2019-10-07 13:50:06,552 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-10-07 13:50:06,916 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 86 [2019-10-07 13:50:07,026 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 1 [2019-10-07 13:50:07,576 WARN L191 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 96 [2019-10-07 13:50:07,782 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 62 [2019-10-07 13:50:07,978 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-10-07 13:50:08,192 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-10-07 13:50:08,312 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 1 [2019-10-07 13:50:08,474 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-10-07 13:50:08,716 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 [2019-10-07 13:50:09,294 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 96 [2019-10-07 13:50:09,520 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-10-07 13:50:09,886 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-07 13:50:10,018 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:10,216 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-10-07 13:50:10,381 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-10-07 13:50:10,589 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-10-07 13:50:10,833 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 69 [2019-10-07 13:50:11,192 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 69 [2019-10-07 13:50:11,669 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 75 [2019-10-07 13:50:11,831 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-10-07 13:50:12,225 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-10-07 13:50:12,342 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 1 [2019-10-07 13:50:12,552 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 62 [2019-10-07 13:50:12,676 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2019-10-07 13:50:13,163 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2019-10-07 13:50:13,317 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-10-07 13:50:13,536 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 66 [2019-10-07 13:50:13,651 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-10-07 13:50:13,833 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-10-07 13:50:13,945 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2019-10-07 13:50:14,180 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 1 [2019-10-07 13:50:14,183 INFO L443 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 878 899) no Hoare annotation was computed. [2019-10-07 13:50:14,183 INFO L446 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 878 899) the Hoare annotation is: true [2019-10-07 13:50:14,183 INFO L439 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 69 89) 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:14,184 INFO L443 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 69 89) no Hoare annotation was computed. [2019-10-07 13:50:14,184 INFO L443 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 900 920) no Hoare annotation was computed. [2019-10-07 13:50:14,184 INFO L446 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 900 920) the Hoare annotation is: true [2019-10-07 13:50:14,184 INFO L443 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 649 655) no Hoare annotation was computed. [2019-10-07 13:50:14,184 INFO L443 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsENTRY(lines 649 655) no Hoare annotation was computed. [2019-10-07 13:50:14,184 INFO L443 ceAbstractionStarter]: For program point L258-1(line 258) no Hoare annotation was computed. [2019-10-07 13:50:14,185 INFO L439 ceAbstractionStarter]: At program point L283(line 283) 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 (= 0 ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (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:14,185 INFO L443 ceAbstractionStarter]: For program point L283-1(line 283) no Hoare annotation was computed. [2019-10-07 13:50:14,185 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 248) no Hoare annotation was computed. [2019-10-07 13:50:14,185 INFO L443 ceAbstractionStarter]: For program point L209(lines 209 428) no Hoare annotation was computed. [2019-10-07 13:50:14,186 INFO L439 ceAbstractionStarter]: At program point L366(line 366) 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 (= |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:14,186 INFO L443 ceAbstractionStarter]: For program point L399-1(lines 399 403) no Hoare annotation was computed. [2019-10-07 13:50:14,186 INFO L443 ceAbstractionStarter]: For program point L366-1(lines 362 368) no Hoare annotation was computed. [2019-10-07 13:50:14,186 INFO L443 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2019-10-07 13:50:14,186 INFO L439 ceAbstractionStarter]: At program point L391(line 391) 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 (= 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:14,186 INFO L443 ceAbstractionStarter]: For program point L391-1(line 391) no Hoare annotation was computed. [2019-10-07 13:50:14,187 INFO L439 ceAbstractionStarter]: At program point L383(line 383) 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 (= |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:14,187 INFO L443 ceAbstractionStarter]: For program point L383-1(lines 379 385) no Hoare annotation was computed. [2019-10-07 13:50:14,187 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 425) no Hoare annotation was computed. [2019-10-07 13:50:14,187 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 347) no Hoare annotation was computed. [2019-10-07 13:50:14,187 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 347) no Hoare annotation was computed. [2019-10-07 13:50:14,187 INFO L439 ceAbstractionStarter]: At program point L210(lines 209 428) 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 (= |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) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= 0 FloppyPnp_~ntStatus~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~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:14,187 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 332) no Hoare annotation was computed. [2019-10-07 13:50:14,188 INFO L443 ceAbstractionStarter]: For program point L326-1(lines 321 333) no Hoare annotation was computed. [2019-10-07 13:50:14,188 INFO L439 ceAbstractionStarter]: At program point L227(lines 227 422) 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 (= |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:14,188 INFO L439 ceAbstractionStarter]: At program point L417(line 417) 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 (= 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:14,188 INFO L443 ceAbstractionStarter]: For program point L417-1(line 417) no Hoare annotation was computed. [2019-10-07 13:50:14,188 INFO L439 ceAbstractionStarter]: At program point L252(line 252) 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 (= 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:14,189 INFO L443 ceAbstractionStarter]: For program point L252-1(line 252) no Hoare annotation was computed. [2019-10-07 13:50:14,189 INFO L439 ceAbstractionStarter]: At program point L277(line 277) 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 (= |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:14,189 INFO L443 ceAbstractionStarter]: For program point L277-1(lines 273 279) no Hoare annotation was computed. [2019-10-07 13:50:14,189 INFO L439 ceAbstractionStarter]: At program point L401(line 401) 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)) (and (= ~s~0 ~SKIP2~0) .cse0 .cse1 .cse2) (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 (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 (<= (+ ~IPC~0 ~SKIP1~0) (+ ~s~0 |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:14,189 INFO L443 ceAbstractionStarter]: For program point L401-1(line 401) no Hoare annotation was computed. [2019-10-07 13:50:14,189 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 398) no Hoare annotation was computed. [2019-10-07 13:50:14,190 INFO L443 ceAbstractionStarter]: For program point L393-2(lines 231 419) no Hoare annotation was computed. [2019-10-07 13:50:14,190 INFO L439 ceAbstractionStarter]: At program point L344(line 344) 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 (= |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)) (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) (= ~setEventCalled~0 1)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:14,190 INFO L443 ceAbstractionStarter]: For program point L344-1(line 344) no Hoare annotation was computed. [2019-10-07 13:50:14,190 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 427) no Hoare annotation was computed. [2019-10-07 13:50:14,190 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 309) no Hoare annotation was computed. [2019-10-07 13:50:14,190 INFO L439 ceAbstractionStarter]: At program point L328(line 328) 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 (= |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:14,190 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 293) no Hoare annotation was computed. [2019-10-07 13:50:14,191 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 424) no Hoare annotation was computed. [2019-10-07 13:50:14,191 INFO L439 ceAbstractionStarter]: At program point L411(line 411) 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 (= |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:14,191 INFO L443 ceAbstractionStarter]: For program point L411-1(lines 407 413) no Hoare annotation was computed. [2019-10-07 13:50:14,191 INFO L439 ceAbstractionStarter]: At program point L246(line 246) 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 (= |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:14,191 INFO L443 ceAbstractionStarter]: For program point L246-1(lines 242 248) no Hoare annotation was computed. [2019-10-07 13:50:14,192 INFO L439 ceAbstractionStarter]: At program point L205(line 205) 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 (= |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:14,192 INFO L443 ceAbstractionStarter]: For program point L238-1(lines 231 419) no Hoare annotation was computed. [2019-10-07 13:50:14,192 INFO L443 ceAbstractionStarter]: For program point L205-1(line 205) no Hoare annotation was computed. [2019-10-07 13:50:14,192 INFO L439 ceAbstractionStarter]: At program point L395(lines 395 396) 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)) (and (= ~s~0 ~SKIP2~0) .cse0 .cse1 .cse2) (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 (= ~s~0 ~IPC~0) .cse0 .cse1 .cse2 (<= (+ ~IPC~0 ~SKIP1~0) (+ ~s~0 |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:14,192 INFO L443 ceAbstractionStarter]: For program point L362(lines 362 368) no Hoare annotation was computed. [2019-10-07 13:50:14,192 INFO L443 ceAbstractionStarter]: For program point L395-1(lines 395 396) no Hoare annotation was computed. [2019-10-07 13:50:14,193 INFO L439 ceAbstractionStarter]: At program point L230(lines 229 422) 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 (= |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:14,193 INFO L439 ceAbstractionStarter]: At program point L420(lines 231 421) the Hoare annotation is: (let ((.cse1 (= 0 ~pended~0)) (.cse5 (= ~s~0 ~DC~0)) (.cse0 (= ~s~0 ~IPC~0)) (.cse3 (<= (+ ~IPC~0 ~SKIP1~0) (+ ~s~0 |old(~s~0)|))) (.cse2 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~0)) (.cse6 (= ~s~0 ~SKIP2~0)) (.cse7 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (<= ~compRegistered~0 0))) (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) .cse5 .cse4) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (not (= |old(~compRegistered~0)| 0)) (and .cse6 .cse1 .cse2 .cse4) (and (and .cse1 .cse5) (not (= 259 FloppyPnp_~ntStatus~0))) (and .cse0 .cse2 .cse7 .cse3 .cse4) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (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)|)) (not (<= (+ ~DC~0 5) ~IPC~0)) (and .cse2 .cse6 .cse7 .cse4) (not (= |old(~customIrp~0)| 0)))) [2019-10-07 13:50:14,193 INFO L439 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (let ((.cse0 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse1 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse2 (= ~s~0 ~NP~0)) (.cse3 (and .cse0 (= 0 ~pended~0) .cse1 (<= 1 ~compRegistered~0))) (.cse4 (= |old(~customIrp~0)| ~customIrp~0))) (or (not .cse0) (not (<= ~MaximumInterfaceType~0 0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not .cse1) (and .cse2 (= FloppyPnp_~__cil_tmp30~0 FloppyPnp_~ntStatus~0) .cse3 (not (= FloppyPnp_~__cil_tmp30~0 259)) .cse4 (= ~setEventCalled~0 1)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (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 (not (= ~myStatus~0 259)) .cse2 (not (= 259 FloppyPnp_~ntStatus~0)) .cse3 .cse4) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))))) [2019-10-07 13:50:14,193 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 333) no Hoare annotation was computed. [2019-10-07 13:50:14,194 INFO L439 ceAbstractionStarter]: At program point L222(lines 218 425) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (not (= ~myStatus~0 259)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= 259 FloppyPnp_~ntStatus~0)) (= ~s~0 |old(~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 (= |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:14,194 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 385) no Hoare annotation was computed. [2019-10-07 13:50:14,194 INFO L439 ceAbstractionStarter]: At program point L313(line 313) 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 (= 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:14,194 INFO L443 ceAbstractionStarter]: For program point L313-1(line 313) no Hoare annotation was computed. [2019-10-07 13:50:14,194 INFO L439 ceAbstractionStarter]: At program point L338(line 338) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (and (= ~myStatus~0 0) (= 0 ~pended~0) (not (= 259 FloppyPnp_~ntStatus~0)) (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~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 (= |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:14,194 INFO L443 ceAbstractionStarter]: For program point L338-1(line 338) no Hoare annotation was computed. [2019-10-07 13:50:14,195 INFO L439 ceAbstractionStarter]: At program point L264(lines 264 265) 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 (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (and (not (= |old(~myStatus~0)| 0)) (not (= 0 (+ |old(~myStatus~0)| 1073741637)))) (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:14,195 INFO L443 ceAbstractionStarter]: For program point L297-1(lines 231 419) no Hoare annotation was computed. [2019-10-07 13:50:14,195 INFO L443 ceAbstractionStarter]: For program point L264-1(lines 264 265) no Hoare annotation was computed. [2019-10-07 13:50:14,195 INFO L443 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 162 435) no Hoare annotation was computed. [2019-10-07 13:50:14,195 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 426) no Hoare annotation was computed. [2019-10-07 13:50:14,195 INFO L439 ceAbstractionStarter]: At program point L372(line 372) 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 (= 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:14,195 INFO L443 ceAbstractionStarter]: For program point L372-1(line 372) no Hoare annotation was computed. [2019-10-07 13:50:14,196 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 279) no Hoare annotation was computed. [2019-10-07 13:50:14,196 INFO L439 ceAbstractionStarter]: At program point L323(line 323) 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 (= |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:14,196 INFO L439 ceAbstractionStarter]: At program point L224(lines 224 423) 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 (= |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:14,196 INFO L439 ceAbstractionStarter]: At program point L216(lines 212 427) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~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 (= |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:14,196 INFO L439 ceAbstractionStarter]: At program point L307(line 307) 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 (= |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:14,196 INFO L443 ceAbstractionStarter]: For program point L307-1(lines 303 309) no Hoare annotation was computed. [2019-10-07 13:50:14,197 INFO L443 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 162 435) no Hoare annotation was computed. [2019-10-07 13:50:14,197 INFO L443 ceAbstractionStarter]: For program point L200(lines 200 208) no Hoare annotation was computed. [2019-10-07 13:50:14,197 INFO L439 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 162 435) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~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 (= |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:14,197 INFO L439 ceAbstractionStarter]: At program point L291(line 291) 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 (= |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)) (and (<= (+ FloppyPnp_~ntStatus~0 1073741823) 0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:14,197 INFO L439 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~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 (= |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:14,198 INFO L439 ceAbstractionStarter]: At program point L795(line 795) 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:14,198 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 669 808) no Hoare annotation was computed. [2019-10-07 13:50:14,198 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 791) no Hoare annotation was computed. [2019-10-07 13:50:14,198 INFO L439 ceAbstractionStarter]: At program point L771(line 771) 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:14,198 INFO L439 ceAbstractionStarter]: At program point L780(lines 767 800) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse6 (and .cse1 .cse2 .cse4 (= ~s~0 ~DC~0))) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse7 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse5 (<= ~compRegistered~0 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0))) (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 (and (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse3 .cse6)) .cse7) .cse8) (not (= main_~status~1 259))) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse5) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= (+ main_~status~1 1073741738) 0) .cse6) (and .cse0 (and (<= ~SKIP2~0 ~s~0) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse5) .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:14,198 INFO L443 ceAbstractionStarter]: For program point L739(line 739) no Hoare annotation was computed. [2019-10-07 13:50:14,199 INFO L439 ceAbstractionStarter]: At program point L764(lines 757 803) the Hoare annotation is: (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0))) (let ((.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse7 (<= ~compRegistered~0 0)) (.cse3 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse5 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse6 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse8 (and .cse1 .cse2 .cse4 (= ~s~0 ~DC~0)))) (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 (= ~s~0 ~SKIP2~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~compRegistered~0)| 0)) (and .cse0 (= ~s~0 ~IPC~0) .cse2 .cse3 .cse4 (<= (+ ~DC~0 7) ~s~0) .cse7) (and (not (= main_~status~1 259)) (and .cse3 .cse5 .cse8 .cse6)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= (+ main_~status~1 1073741738) 0) .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:14,199 INFO L439 ceAbstractionStarter]: At program point L789(line 789) 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:14,199 INFO L439 ceAbstractionStarter]: At program point L756(lines 749 804) the Hoare annotation is: (let ((.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (= ~s~0 ~DC~0))) (let ((.cse8 (= ~s~0 ~SKIP2~0)) (.cse13 (and .cse9 .cse2 .cse3 .cse5 .cse14)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (= ~s~0 ~IPC~0)) (.cse4 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 7) ~s~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= |old(~customIrp~0)| ~customIrp~0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= ~compRegistered~0 0))) (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 .cse8 .cse9 .cse3 .cse4 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse5 .cse10 .cse12 .cse7) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (and .cse13 .cse4 .cse10 .cse12) (not (= main_~status~1 259))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= (+ main_~status~1 1073741738) 0) .cse13) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse9 .cse3 .cse4 .cse5 (<= (+ main_~status~1 1073741823) 0) .cse10 .cse14 .cse12 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11 .cse12 .cse7) (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:14,199 INFO L443 ceAbstractionStarter]: For program point L723(lines 709 748) no Hoare annotation was computed. [2019-10-07 13:50:14,199 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 669 808) no Hoare annotation was computed. [2019-10-07 13:50:14,200 INFO L439 ceAbstractionStarter]: At program point L707(line 707) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 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(~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:14,200 INFO L443 ceAbstractionStarter]: For program point L707-1(lines 703 807) no Hoare annotation was computed. [2019-10-07 13:50:14,200 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 669 808) 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:14,200 INFO L443 ceAbstractionStarter]: For program point L765(lines 749 804) no Hoare annotation was computed. [2019-10-07 13:50:14,200 INFO L439 ceAbstractionStarter]: At program point L732(lines 732 747) 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)|)) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= main_~status~1 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= |old(~customIrp~0)| ~customIrp~0) (<= ~MaximumInterfaceType~0 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:14,200 INFO L443 ceAbstractionStarter]: For program point L766(lines 766 801) no Hoare annotation was computed. [2019-10-07 13:50:14,201 INFO L439 ceAbstractionStarter]: At program point L733(lines 732 747) 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)|)) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= main_~status~1 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= |old(~customIrp~0)| ~customIrp~0) (<= ~MaximumInterfaceType~0 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:14,201 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 762) no Hoare annotation was computed. [2019-10-07 13:50:14,201 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 754) no Hoare annotation was computed. [2019-10-07 13:50:14,201 INFO L439 ceAbstractionStarter]: At program point L709(lines 703 807) the Hoare annotation is: (let ((.cse9 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= 0 ~pended~0)) (.cse3 (<= (+ ~NP~0 5) ~MPR3~0)) (.cse5 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse14 (= ~s~0 ~DC~0))) (let ((.cse8 (= ~s~0 ~SKIP2~0)) (.cse13 (and .cse9 .cse2 .cse3 .cse5 .cse14)) (.cse0 (= main_~status~1 ~lowerDriverReturn~0)) (.cse1 (= ~s~0 ~IPC~0)) (.cse4 (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0))) (.cse6 (<= (+ ~DC~0 7) ~s~0)) (.cse10 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse11 (= |old(~customIrp~0)| ~customIrp~0)) (.cse12 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse7 (<= ~compRegistered~0 0))) (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 .cse8 .cse9 .cse3 .cse4 .cse5 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse5 .cse10 .cse12 .cse7) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (and .cse13 .cse4 .cse10 .cse12) (not (= main_~status~1 259))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= (+ main_~status~1 1073741738) 0) .cse13) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse9 .cse3 .cse4 .cse5 (<= (+ main_~status~1 1073741823) 0) .cse10 .cse14 .cse12 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse11 .cse12 .cse7) (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:14,201 INFO L443 ceAbstractionStarter]: For program point L767(lines 767 800) no Hoare annotation was computed. [2019-10-07 13:50:14,202 INFO L439 ceAbstractionStarter]: At program point L718-2(lines 718 721) 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)|)) (and (<= (+ ~DC~0 5) ~IPC~0) (= 0 ~pended~0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) (<= (+ ~SKIP1~0 2) ~MPR1~0) (<= (+ ~NP~0 4) ~MPR1~0) (= main_~status~1 0) (<= (+ ~NP~0 5) ~MPR3~0) (<= (+ ~DC~0 2) ~SKIP2~0) (or (= ~myStatus~0 0) (= (+ ~myStatus~0 1073741637) 0)) (= |old(~customIrp~0)| ~customIrp~0) (<= ~MaximumInterfaceType~0 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:14,202 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 778) no Hoare annotation was computed. [2019-10-07 13:50:14,202 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 797) no Hoare annotation was computed. [2019-10-07 13:50:14,202 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 775) no Hoare annotation was computed. [2019-10-07 13:50:14,202 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 798) no Hoare annotation was computed. [2019-10-07 13:50:14,202 INFO L443 ceAbstractionStarter]: For program point L1146(line 1146) no Hoare annotation was computed. [2019-10-07 13:50:14,202 INFO L443 ceAbstractionStarter]: For program point L1146-1(line 1146) no Hoare annotation was computed. [2019-10-07 13:50:14,202 INFO L443 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 1137 1150) no Hoare annotation was computed. [2019-10-07 13:50:14,202 INFO L443 ceAbstractionStarter]: For program point FloppyCreateCloseENTRY(lines 1137 1150) no Hoare annotation was computed. [2019-10-07 13:50:14,203 INFO L439 ceAbstractionStarter]: At program point L929(line 929) the Hoare annotation is: (let ((.cse0 (not (= ~myStatus~0 0)))) (let ((.cse3 (not (<= ~MaximumInterfaceType~0 0))) (.cse1 (or (not (= ~setEventCalled~0 1)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (or (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~pended~0))) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (.cse4 (and .cse0 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse2 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2) (or (not (= ~customIrp~0 1)) .cse1 .cse3 .cse4) (or .cse3 .cse1 .cse4 .cse2)))) [2019-10-07 13:50:14,203 INFO L443 ceAbstractionStarter]: For program point L929-1(lines 921 934) no Hoare annotation was computed. [2019-10-07 13:50:14,203 INFO L439 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 921 934) the Hoare annotation is: (let ((.cse4 (not (= ~myStatus~0 0)))) (let ((.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (= ~s~0 |old(~s~0)|)) (.cse0 (or (not (= ~setEventCalled~0 1)) (not (= |old(~s~0)| ~NP~0)) (not (<= (+ ~SKIP1~0 2) ~MPR1~0)) (or (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (= 0 ~pended~0))) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 5) ~IPC~0))) (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0))) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)))) (.cse3 (and .cse4 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse5 (not (= ~customIrp~0 0)))) (and (or (not (= ~customIrp~0 1)) .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse0 .cse2 .cse5) (or .cse1 .cse2 .cse0 .cse3 .cse5)))) [2019-10-07 13:50:14,203 INFO L443 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 921 934) no Hoare annotation was computed. [2019-10-07 13:50:14,203 INFO L446 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: true [2019-10-07 13:50:14,203 INFO L443 ceAbstractionStarter]: For program point L609-1(line 609) no Hoare annotation was computed. [2019-10-07 13:50:14,203 INFO L446 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 604 613) the Hoare annotation is: true [2019-10-07 13:50:14,204 INFO L443 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 604 613) no Hoare annotation was computed. [2019-10-07 13:50:14,204 INFO L443 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 1030 1071) no Hoare annotation was computed. [2019-10-07 13:50:14,204 INFO L439 ceAbstractionStarter]: At program point L1043(lines 1035 1054) the Hoare annotation is: (let ((.cse10 (not (= ~myStatus~0 0))) (.cse11 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse12 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse9 (not (= |old(~customIrp~0)| 0))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse3 (not (<= ~MaximumInterfaceType~0 0))) (.cse4 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (or .cse11 (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) .cse12)) (.cse6 (not (= |old(~s~0)| ~MPR3~0))) (.cse7 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse8 (and .cse10 (not (= 0 (+ ~myStatus~0 1073741637)))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse9) (or .cse11 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 (not (= ~compRegistered~0 0)) .cse4 (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) .cse7 .cse12 .cse9) (or .cse0 (not (= |old(~customIrp~0)| 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2019-10-07 13:50:14,204 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1054) no Hoare annotation was computed. [2019-10-07 13:50:14,204 INFO L439 ceAbstractionStarter]: At program point L1050(line 1050) the Hoare annotation is: (let ((.cse10 (not (= ~myStatus~0 0))) (.cse11 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse12 (not (<= (+ ~DC~0 5) ~IPC~0)))) (let ((.cse9 (not (= |old(~customIrp~0)| 0))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse3 (not (<= ~MaximumInterfaceType~0 0))) (.cse4 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse5 (or .cse11 (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) .cse12)) (.cse6 (not (= |old(~s~0)| ~MPR3~0))) (.cse7 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse8 (and .cse10 (not (= 0 (+ ~myStatus~0 1073741637)))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse9) (or .cse11 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 (not (= ~compRegistered~0 0)) .cse4 .cse7 .cse12 .cse9) (or .cse0 (not (= |old(~customIrp~0)| 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2019-10-07 13:50:14,204 INFO L443 ceAbstractionStarter]: For program point L1048(lines 1048 1052) no Hoare annotation was computed. [2019-10-07 13:50:14,205 INFO L439 ceAbstractionStarter]: At program point L1048-1(lines 1035 1054) the Hoare annotation is: (let ((.cse2 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse6 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse14 (not (= ~myStatus~0 0)))) (let ((.cse10 (not (<= ~MaximumInterfaceType~0 0))) (.cse13 (and .cse14 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse8 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse4 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse11 (or .cse0 (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) .cse6)) (.cse12 (not (= |old(~s~0)| ~MPR3~0))) (.cse5 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse9 (and (= ~s~0 ~NP~0) .cse2)) (.cse7 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~s~0)| ~NP~0)) .cse1 (and (= ~s~0 |old(~s~0)|) .cse2) .cse3 (not (= ~compRegistered~0 0)) .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 (not (= |old(~customIrp~0)| 1)) .cse1 .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse13) (or .cse9 .cse8 .cse1 .cse3 .cse10 .cse4 .cse11 .cse12 .cse5 .cse13 .cse7) (or .cse8 .cse1 .cse3 .cse14 .cse4 .cse11 .cse12 .cse5 .cse9 .cse7)))) [2019-10-07 13:50:14,205 INFO L443 ceAbstractionStarter]: For program point L1036(lines 1036 1041) no Hoare annotation was computed. [2019-10-07 13:50:14,205 INFO L439 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 1030 1071) the Hoare annotation is: (let ((.cse3 (not (= ~myStatus~0 0))) (.cse10 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse11 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse12 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse1 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse2 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse13 (not (<= ~MaximumInterfaceType~0 0))) (.cse4 (and (= ~MPR3~0 ~s~0) .cse12 (= ~setEventCalled~0 1))) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse6 (or .cse10 (not (= 0 ~pended~0)) (not (<= 1 ~compRegistered~0)) .cse11)) (.cse7 (not (= |old(~s~0)| ~MPR3~0))) (.cse8 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse14 (and .cse3 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse9 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 (not (= ~compRegistered~0 0)) .cse5 .cse8 .cse11 (and (= ~s~0 |old(~s~0)|) .cse12) .cse9) (or .cse0 (not (= |old(~customIrp~0)| 1)) .cse1 .cse2 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14) (or .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9)))) [2019-10-07 13:50:14,205 INFO L439 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 1008 1021) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse9 (not (= 0 ~pended~0))) (.cse6 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse7 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse8 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 (= ~s~0 ~NP~0) .cse4 .cse9 .cse7 .cse8) (or (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse6 (not (<= 1 ~compRegistered~0)) .cse7 .cse8) .cse5))) [2019-10-07 13:50:14,206 INFO L439 ceAbstractionStarter]: At program point L1016(line 1016) the Hoare annotation is: (let ((.cse4 (not (= 0 ~pended~0))) (.cse0 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse2 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse3 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse8 (not (= ~compRegistered~0 0))) (.cse5 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse6 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse7 (not (<= (+ ~DC~0 5) ~IPC~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (<= 1 ~compRegistered~0)) .cse6 .cse7) (or .cse0 .cse1 .cse8 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse5 .cse6 .cse7))) [2019-10-07 13:50:14,206 INFO L443 ceAbstractionStarter]: For program point L1016-1(lines 1008 1021) no Hoare annotation was computed. [2019-10-07 13:50:14,206 INFO L443 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 1008 1021) no Hoare annotation was computed. [2019-10-07 13:50:14,206 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1018) no Hoare annotation was computed. [2019-10-07 13:50:14,206 INFO L443 ceAbstractionStarter]: For program point L514-2(lines 514 519) no Hoare annotation was computed. [2019-10-07 13:50:14,206 INFO L443 ceAbstractionStarter]: For program point L564(lines 564 566) no Hoare annotation was computed. [2019-10-07 13:50:14,206 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 504) no Hoare annotation was computed. [2019-10-07 13:50:14,206 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 493 505) no Hoare annotation was computed. [2019-10-07 13:50:14,207 INFO L439 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 436 603) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (and (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~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 (= |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:14,207 INFO L443 ceAbstractionStarter]: For program point L532(lines 532 572) no Hoare annotation was computed. [2019-10-07 13:50:14,207 INFO L439 ceAbstractionStarter]: At program point L516(line 516) 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 (= |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 (<= 1 ~compRegistered~0) (= ~MPR3~0 ~s~0) (= FloppyStartDevice_~__cil_tmp42~0 259) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 1)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:14,207 INFO L443 ceAbstractionStarter]: For program point L516-1(line 516) no Hoare annotation was computed. [2019-10-07 13:50:14,207 INFO L439 ceAbstractionStarter]: At program point L574-2(lines 574 581) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (and (not (= ~myStatus~0 259)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (not (= FloppyStartDevice_~ntStatus~1 259))) (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 (= |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:14,208 INFO L439 ceAbstractionStarter]: At program point L599(line 599) 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 (= |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 (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (not (= FloppyStartDevice_~ntStatus~1 259))) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:14,208 INFO L443 ceAbstractionStarter]: For program point L599-1(line 599) no Hoare annotation was computed. [2019-10-07 13:50:14,208 INFO L443 ceAbstractionStarter]: For program point L533(lines 533 543) no Hoare annotation was computed. [2019-10-07 13:50:14,208 INFO L439 ceAbstractionStarter]: At program point L500(line 500) 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 (= |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:14,208 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 584) no Hoare annotation was computed. [2019-10-07 13:50:14,208 INFO L443 ceAbstractionStarter]: For program point L493(lines 493 505) no Hoare annotation was computed. [2019-10-07 13:50:14,208 INFO L439 ceAbstractionStarter]: At program point L510(line 510) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (and (= ~s~0 |old(~s~0)|) (<= 1 ~compRegistered~0) (= ~myStatus~0 |old(~myStatus~0)|) (= |old(~customIrp~0)| ~customIrp~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 (= |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:14,208 INFO L443 ceAbstractionStarter]: For program point L510-1(line 510) no Hoare annotation was computed. [2019-10-07 13:50:14,209 INFO L439 ceAbstractionStarter]: At program point L535(line 535) 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 (not (= ~myStatus~0 259)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~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:14,209 INFO L443 ceAbstractionStarter]: For program point L535-1(line 535) no Hoare annotation was computed. [2019-10-07 13:50:14,209 INFO L439 ceAbstractionStarter]: At program point L560(lines 560 562) 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 (= |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:14,209 INFO L443 ceAbstractionStarter]: For program point L560-1(lines 560 562) no Hoare annotation was computed. [2019-10-07 13:50:14,209 INFO L443 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 436 603) no Hoare annotation was computed. [2019-10-07 13:50:14,209 INFO L439 ceAbstractionStarter]: At program point L552-2(lines 552 568) 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 (= |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 (= 0 FloppyStartDevice_~InterfaceType~0) (and (not (= ~myStatus~0 259)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (not (= FloppyStartDevice_~ntStatus~1 259))) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) [2019-10-07 13:50:14,210 INFO L439 ceAbstractionStarter]: At program point L569(lines 530 595) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (and (not (= ~myStatus~0 259)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (not (= FloppyStartDevice_~ntStatus~1 259))) (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 (= |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:14,210 INFO L439 ceAbstractionStarter]: At program point L528(line 528) the Hoare annotation is: (or (and (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~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 (= |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:14,210 INFO L439 ceAbstractionStarter]: At program point L495(line 495) 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 (= |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:14,210 INFO L443 ceAbstractionStarter]: For program point L528-1(line 528) no Hoare annotation was computed. [2019-10-07 13:50:14,211 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 591) no Hoare annotation was computed. [2019-10-07 13:50:14,211 INFO L443 ceAbstractionStarter]: For program point L553(lines 552 568) no Hoare annotation was computed. [2019-10-07 13:50:14,211 INFO L443 ceAbstractionStarter]: For program point L586-2(lines 586 591) no Hoare annotation was computed. [2019-10-07 13:50:14,211 INFO L439 ceAbstractionStarter]: At program point L545(lines 532 572) the Hoare annotation is: (or (and (and (not (= ~myStatus~0 259)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (not (= FloppyStartDevice_~ntStatus~1 259))) (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 (= |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:14,211 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 595) no Hoare annotation was computed. [2019-10-07 13:50:14,211 INFO L443 ceAbstractionStarter]: For program point L530-1(lines 530 595) no Hoare annotation was computed. [2019-10-07 13:50:14,211 INFO L439 ceAbstractionStarter]: At program point L588(lines 588 589) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (and (and (not (= ~myStatus~0 259)) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0))) (not (= FloppyStartDevice_~ntStatus~1 259))) (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 (= |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:14,212 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 588 589) no Hoare annotation was computed. [2019-10-07 13:50:14,212 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 519) no Hoare annotation was computed. [2019-10-07 13:50:14,212 INFO L443 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 1094 1115) no Hoare annotation was computed. [2019-10-07 13:50:14,212 INFO L446 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 1094 1115) the Hoare annotation is: true [2019-10-07 13:50:14,212 INFO L443 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 1072 1093) no Hoare annotation was computed. [2019-10-07 13:50:14,212 INFO L446 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 1072 1093) the Hoare annotation is: true [2019-10-07 13:50:14,212 INFO L443 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 809 833) no Hoare annotation was computed. [2019-10-07 13:50:14,212 INFO L439 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 809 833) the Hoare annotation is: (or (= |old(~customIrp~0)| ~customIrp~0) (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 (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (not (<= ~MaximumInterfaceType~0 0)) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637))))) [2019-10-07 13:50:14,212 INFO L446 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 1022 1029) the Hoare annotation is: true [2019-10-07 13:50:14,213 INFO L443 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 1022 1029) no Hoare annotation was computed. [2019-10-07 13:50:14,213 INFO L443 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 656 668) no Hoare annotation was computed. [2019-10-07 13:50:14,213 INFO L439 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 656 668) the Hoare annotation is: (or (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= ~MaximumInterfaceType~0 0)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637)))) (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:14,213 INFO L446 ceAbstractionStarter]: At program point errorFnENTRY(lines 60 67) the Hoare annotation is: true [2019-10-07 13:50:14,213 INFO L443 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 64) no Hoare annotation was computed. [2019-10-07 13:50:14,213 INFO L443 ceAbstractionStarter]: For program point errorFnEXIT(lines 60 67) no Hoare annotation was computed. [2019-10-07 13:50:14,213 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 150) no Hoare annotation was computed. [2019-10-07 13:50:14,213 INFO L443 ceAbstractionStarter]: For program point L120-2(lines 112 160) no Hoare annotation was computed. [2019-10-07 13:50:14,214 INFO L443 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 99 161) no Hoare annotation was computed. [2019-10-07 13:50:14,214 INFO L439 ceAbstractionStarter]: At program point L143(line 143) the Hoare annotation is: (or (= 0 ~pended~0) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~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 (<= (+ ~DC~0 5) ~IPC~0)) (not (= ~customIrp~0 0))) [2019-10-07 13:50:14,214 INFO L443 ceAbstractionStarter]: For program point L143-1(line 143) no Hoare annotation was computed. [2019-10-07 13:50:14,214 INFO L439 ceAbstractionStarter]: At program point L141(lines 141 142) the Hoare annotation is: (or (= 0 ~pended~0) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~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 (<= (+ ~DC~0 5) ~IPC~0)) (not (= ~customIrp~0 0))) [2019-10-07 13:50:14,214 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 141 142) no Hoare annotation was computed. [2019-10-07 13:50:14,214 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 138) no Hoare annotation was computed. [2019-10-07 13:50:14,214 INFO L439 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 99 161) the Hoare annotation is: (or (= 0 ~pended~0) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~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 (<= (+ ~DC~0 5) ~IPC~0)) (not (= ~customIrp~0 0))) [2019-10-07 13:50:14,215 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 128) no Hoare annotation was computed. [2019-10-07 13:50:14,215 INFO L443 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 99 161) no Hoare annotation was computed. [2019-10-07 13:50:14,215 INFO L439 ceAbstractionStarter]: At program point L156(line 156) 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)) (not (= ~customIrp~0 0))) [2019-10-07 13:50:14,215 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 152 158) no Hoare annotation was computed. [2019-10-07 13:50:14,215 INFO L439 ceAbstractionStarter]: At program point L123-2(lines 123 125) the Hoare annotation is: (or (= 0 ~pended~0) (not (<= (+ ~NP~0 5) ~MPR3~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= (+ ~DC~0 2) ~SKIP2~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 (<= (+ ~DC~0 5) ~IPC~0)) (not (= ~customIrp~0 0))) [2019-10-07 13:50:14,215 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-10-07 13:50:14,215 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 118) no Hoare annotation was computed. [2019-10-07 13:50:14,215 INFO L443 ceAbstractionStarter]: For program point L986(lines 986 1003) no Hoare annotation was computed. [2019-10-07 13:50:14,216 INFO L443 ceAbstractionStarter]: For program point L949(lines 949 953) no Hoare annotation was computed. [2019-10-07 13:50:14,216 INFO L439 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 935 1007) the Hoare annotation is: (let ((.cse16 (<= (+ ~DC~0 5) ~IPC~0)) (.cse19 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse22 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse17 (= 0 ~pended~0)) (.cse20 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse18 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (not .cse18)) (.cse6 (not .cse20)) (.cse7 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse14 (not .cse17)) (.cse10 (not .cse22)) (.cse21 (<= 1 ~compRegistered~0)) (.cse11 (not .cse19)) (.cse12 (not .cse16)) (.cse15 (not (= ~myStatus~0 0)))) (let ((.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse5 (= ~SKIP1~0 ~s~0)) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (and .cse15 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse1 (or .cse4 (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse14 .cse10 (not .cse21) .cse11 .cse12)) (.cse0 (and .cse16 .cse17 .cse18 (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse19 .cse20 .cse21 .cse22)) (.cse13 (not (= ~customIrp~0 0)))) (and (or .cse0 (not (= ~customIrp~0 1)) .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse4 .cse6 .cse7 .cse8 .cse9 .cse14 .cse10 .cse5 .cse11 .cse12) (or .cse1 .cse2 .cse0 .cse3 .cse13) (or .cse1 .cse15 .cse0 .cse13))))) [2019-10-07 13:50:14,216 INFO L439 ceAbstractionStarter]: At program point L978(lines 942 1006) the Hoare annotation is: (let ((.cse5 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse14 (not (= 0 ~pended~0))) (.cse11 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse12 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse13 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse15 (not (= ~myStatus~0 0)))) (let ((.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (and .cse15 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse6 (= ~SKIP1~0 ~s~0)) (.cse0 (or .cse5 (not (= |old(~s~0)| ~NP~0)) .cse7 .cse8 .cse14 .cse11 (not (<= 1 ~compRegistered~0)) .cse12 .cse13)) (.cse2 (let ((.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse16 1) 0) (= ~setEventCalled~0 1)))) (.cse4 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse4) (or (not (= ~customIrp~0 1)) .cse0 .cse2 .cse1 .cse3) (or .cse5 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse6 .cse12 .cse13) (or .cse0 .cse15 .cse2 .cse4)))) [2019-10-07 13:50:14,217 INFO L439 ceAbstractionStarter]: At program point L945(line 945) the Hoare annotation is: (let ((.cse15 (<= (+ ~DC~0 5) ~IPC~0)) (.cse18 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse21 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse16 (= 0 ~pended~0)) (.cse19 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse17 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse4 (not .cse17)) (.cse5 (not .cse19)) (.cse6 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse9 (not .cse16)) (.cse10 (not .cse21)) (.cse20 (<= 1 ~compRegistered~0)) (.cse11 (not .cse18)) (.cse12 (not .cse15)) (.cse14 (not (= ~myStatus~0 0)))) (let ((.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (and .cse14 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse1 (or .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse9 .cse10 (not .cse20) .cse11 .cse12)) (.cse0 (and .cse15 .cse16 .cse17 (= ~s~0 ~NP~0) (<= (+ ~NP~0 ~DC~0 7) (+ ~IPC~0 ~SKIP1~0)) .cse18 .cse19 .cse20 .cse21)) (.cse13 (not (= ~customIrp~0 0)))) (and (or .cse0 (not (= ~customIrp~0 1)) .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse0 .cse3 .cse13) (or .cse1 .cse14 .cse0 .cse13))))) [2019-10-07 13:50:14,217 INFO L443 ceAbstractionStarter]: For program point L945-1(line 945) no Hoare annotation was computed. [2019-10-07 13:50:14,217 INFO L443 ceAbstractionStarter]: For program point L995(lines 995 1002) no Hoare annotation was computed. [2019-10-07 13:50:14,217 INFO L443 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 935 1007) no Hoare annotation was computed. [2019-10-07 13:50:14,217 INFO L439 ceAbstractionStarter]: At program point L1000(line 1000) the Hoare annotation is: (let ((.cse4 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse5 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse6 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse9 (not (= 0 ~pended~0))) (.cse10 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse11 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse12 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse13 (not (= ~myStatus~0 0)))) (let ((.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse2 (and .cse13 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse0 (or .cse4 (not (= |old(~s~0)| ~NP~0)) .cse5 .cse6 .cse9 .cse10 (not (<= 1 ~compRegistered~0)) .cse11 .cse12)) (.cse3 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (not (= ~customIrp~0 1)) .cse0 .cse1 .cse2) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse3) (or .cse0 .cse13 .cse3)))) [2019-10-07 13:50:14,217 INFO L443 ceAbstractionStarter]: For program point L1000-1(lines 982 1004) no Hoare annotation was computed. [2019-10-07 13:50:14,218 INFO L439 ceAbstractionStarter]: At program point L951(line 951) the Hoare annotation is: (let ((.cse15 (<= (+ ~DC~0 5) ~IPC~0)) (.cse18 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse17 (= 0 ~pended~0)) (.cse16 (<= (+ ~NP~0 5) ~MPR3~0))) (let ((.cse14 (not (= ~myStatus~0 0))) (.cse5 (not .cse16)) (.cse6 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse7 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse10 (not .cse17)) (.cse11 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse20 (<= 1 ~compRegistered~0)) (.cse12 (not .cse18)) (.cse13 (not .cse15))) (let ((.cse8 (not (= ~compRegistered~0 0))) (.cse9 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse4 (not (= ~customIrp~0 0))) (.cse1 (or .cse5 (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse10 .cse11 (not .cse20) .cse12 .cse13)) (.cse2 (not (<= ~MaximumInterfaceType~0 0))) (.cse0 (and (let ((.cse19 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and .cse15 .cse16 .cse17 .cse18 (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse19) 3221225494)) .cse20 (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse19 1) 0))) (= ~s~0 |old(~s~0)|) (= ~setEventCalled~0 1))) (.cse3 (and .cse14 (not (= 0 (+ ~myStatus~0 1073741637)))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse4) (or .cse1 .cse14 .cse0 .cse4) (or (not (= ~customIrp~0 1)) .cse1 .cse2 .cse0 .cse3))))) [2019-10-07 13:50:14,218 INFO L443 ceAbstractionStarter]: For program point L943(lines 943 955) no Hoare annotation was computed. [2019-10-07 13:50:14,218 INFO L439 ceAbstractionStarter]: At program point L943-1(lines 943 955) the Hoare annotation is: (let ((.cse5 (not (<= (+ ~NP~0 5) ~MPR3~0))) (.cse7 (not (<= (+ ~SKIP1~0 2) ~MPR1~0))) (.cse8 (not (<= (+ ~DC~0 ~NP~0 7) (+ ~SKIP1~0 ~IPC~0)))) (.cse14 (not (= 0 ~pended~0))) (.cse11 (not (<= (+ ~NP~0 4) ~MPR1~0))) (.cse12 (not (<= (+ ~DC~0 2) ~SKIP2~0))) (.cse13 (not (<= (+ ~DC~0 5) ~IPC~0))) (.cse15 (not (= ~myStatus~0 0)))) (let ((.cse1 (not (<= ~MaximumInterfaceType~0 0))) (.cse3 (and .cse15 (not (= 0 (+ ~myStatus~0 1073741637))))) (.cse9 (not (= ~compRegistered~0 0))) (.cse10 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse6 (= ~SKIP1~0 ~s~0)) (.cse0 (or .cse5 (not (= |old(~s~0)| ~NP~0)) .cse7 .cse8 .cse14 .cse11 (not (<= 1 ~compRegistered~0)) .cse12 .cse13)) (.cse2 (let ((.cse16 (div IofCallDriver_~__cil_tmp7~0 4294967296))) (and (= ~s~0 ~MPR1~0) (<= IofCallDriver_~__cil_tmp7~0 (+ (* 4294967296 .cse16) 3221225494)) (<= 0 (+ IofCallDriver_~__cil_tmp7~0 1073741802)) (<= (+ .cse16 1) 0) (= ~setEventCalled~0 1)))) (.cse4 (not (= ~customIrp~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse4) (or (not (= ~customIrp~0 1)) .cse0 .cse2 .cse1 .cse3) (or .cse5 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse6 .cse12 .cse13) (or .cse0 .cse15 .cse2 .cse4)))) [2019-10-07 13:50:14,218 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:14,218 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:50:14,218 INFO L439 ceAbstractionStarter]: At program point L641(line 641) the Hoare annotation is: (or (and (= FlFdcDeviceIo_~__cil_tmp11~0 259) (= 1 ~customIrp~0) (= FlFdcDeviceIo_~__cil_tmp11~0 FlFdcDeviceIo_~ntStatus~2) (= ~MPR3~0 ~s~0) (= ~setEventCalled~0 1)) (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 (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (not (<= ~MaximumInterfaceType~0 0)) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637))))) [2019-10-07 13:50:14,219 INFO L443 ceAbstractionStarter]: For program point L641-1(line 641) no Hoare annotation was computed. [2019-10-07 13:50:14,219 INFO L443 ceAbstractionStarter]: For program point L639(lines 639 644) no Hoare annotation was computed. [2019-10-07 13:50:14,219 INFO L443 ceAbstractionStarter]: For program point L639-2(lines 639 644) no Hoare annotation was computed. [2019-10-07 13:50:14,219 INFO L439 ceAbstractionStarter]: At program point L635(line 635) the Hoare annotation is: (or (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 (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (not (<= ~MaximumInterfaceType~0 0)) (and (= 1 ~customIrp~0) (= ~s~0 ~NP~0)) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637))))) [2019-10-07 13:50:14,219 INFO L439 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 614 648) the Hoare annotation is: (or (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (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 (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (not (<= ~MaximumInterfaceType~0 0)) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637))))) [2019-10-07 13:50:14,219 INFO L443 ceAbstractionStarter]: For program point L635-1(line 635) no Hoare annotation was computed. [2019-10-07 13:50:14,219 INFO L443 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 614 648) no Hoare annotation was computed. [2019-10-07 13:50:14,219 INFO L443 ceAbstractionStarter]: For program point L629(lines 629 631) no Hoare annotation was computed. [2019-10-07 13:50:14,220 INFO L439 ceAbstractionStarter]: At program point L626(lines 626 627) the Hoare annotation is: (or (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0)) (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 (= 0 ~pended~0)) (not (<= (+ ~NP~0 4) ~MPR1~0)) (not (<= 1 ~compRegistered~0)) (not (<= (+ ~DC~0 2) ~SKIP2~0)) (not (<= (+ ~DC~0 5) ~IPC~0)) (not (= |old(~customIrp~0)| 0))) (not (<= ~MaximumInterfaceType~0 0)) (and (not (= ~myStatus~0 0)) (not (= 0 (+ ~myStatus~0 1073741637))))) [2019-10-07 13:50:14,220 INFO L443 ceAbstractionStarter]: For program point L626-1(lines 626 627) no Hoare annotation was computed. [2019-10-07 13:50:14,220 INFO L443 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 614 648) no Hoare annotation was computed. [2019-10-07 13:50:14,220 INFO L446 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 92 98) the Hoare annotation is: true [2019-10-07 13:50:14,220 INFO L443 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 92 98) no Hoare annotation was computed. [2019-10-07 13:50:14,220 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:50:14,221 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:14,221 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:50:14,221 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:50:14,221 INFO L446 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 834 854) the Hoare annotation is: true [2019-10-07 13:50:14,221 INFO L443 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 834 854) no Hoare annotation was computed. [2019-10-07 13:50:14,221 INFO L443 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 855 877) no Hoare annotation was computed. [2019-10-07 13:50:14,221 INFO L446 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 855 877) the Hoare annotation is: true [2019-10-07 13:50:14,221 INFO L446 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 1116 1136) the Hoare annotation is: true [2019-10-07 13:50:14,221 INFO L443 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 1116 1136) no Hoare annotation was computed. [2019-10-07 13:50:14,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:50:14 BoogieIcfgContainer [2019-10-07 13:50:14,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:50:14,273 INFO L168 Benchmark]: Toolchain (without parser) took 38044.54 ms. Allocated memory was 139.5 MB in the beginning and 635.4 MB in the end (delta: 496.0 MB). Free memory was 102.4 MB in the beginning and 101.7 MB in the end (delta: 728.2 kB). Peak memory consumption was 516.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:14,273 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.2 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:14,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 623.68 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 102.2 MB in the beginning and 173.2 MB in the end (delta: -71.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:14,274 INFO L168 Benchmark]: Boogie Preprocessor took 83.77 ms. Allocated memory is still 202.4 MB. Free memory was 173.2 MB in the beginning and 169.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:14,275 INFO L168 Benchmark]: RCFGBuilder took 1442.53 ms. Allocated memory was 202.4 MB in the beginning and 236.5 MB in the end (delta: 34.1 MB). Free memory was 169.9 MB in the beginning and 155.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:14,276 INFO L168 Benchmark]: TraceAbstraction took 35890.01 ms. Allocated memory was 236.5 MB in the beginning and 635.4 MB in the end (delta: 399.0 MB). Free memory was 155.1 MB in the beginning and 101.7 MB in the end (delta: 53.5 MB). Peak memory consumption was 472.2 MB. Max. memory is 7.1 GB. [2019-10-07 13:50:14,279 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 139.5 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 623.68 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 102.2 MB in the beginning and 173.2 MB in the end (delta: -71.0 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.77 ms. Allocated memory is still 202.4 MB. Free memory was 173.2 MB in the beginning and 169.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1442.53 ms. Allocated memory was 202.4 MB in the beginning and 236.5 MB in the end (delta: 34.1 MB). Free memory was 169.9 MB in the beginning and 155.1 MB in the end (delta: 14.8 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35890.01 ms. Allocated memory was 236.5 MB in the beginning and 635.4 MB in the end (delta: 399.0 MB). Free memory was 155.1 MB in the beginning and 101.7 MB in the end (delta: 53.5 MB). Peak memory consumption was 472.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 64]: 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: 218]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || (((((!(myStatus == 259) && 0 == pended) && 0 == compRegistered) && !(259 == ntStatus)) && s == \old(s)) && \old(customIrp) == customIrp)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(\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: 809]: Loop Invariant Derived loop invariant: ((\old(customIrp) == customIrp || ((((((((!(NP + 5 <= MPR3) || !(s == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) || !(MaximumInterfaceType <= 0)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637)) - InvariantResult [Line: 1035]: Loop Invariant Derived loop invariant: (((((((((((!(\old(setEventCalled) == 1) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(s) == MPR3)) || !(DC + 2 <= SKIP2)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) || !(\old(customIrp) == 0)) && ((((((((!(\old(setEventCalled) == 1) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(s) == MPR3)) || !(DC + 2 <= SKIP2)) || !(\old(customIrp) == 0))) && (((((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(NP + 4 <= MPR1)) || (s == \old(s) && \old(customIrp) == customIrp)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0))) && (((((((((!(\old(setEventCalled) == 1) || !(\old(customIrp) == 1)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(s) == MPR3)) || !(DC + 2 <= SKIP2)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) - InvariantResult [Line: 749]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((status == lowerDriverReturn && s == IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && compRegistered <= 0) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((((status == lowerDriverReturn && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && \old(customIrp) == customIrp) && NP + 4 <= MPR1) && compRegistered <= 0)) || (((((((((status == lowerDriverReturn && s == SKIP2) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(status == 259))) || !(\old(s) == \old(MPR1))) || (status + 1073741738 <= 0 && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) || !(\old(s) == \old(NP))) || ((((((((DC + 5 <= IPC && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && NP + 4 <= MPR1) && compRegistered <= 0)) || (((((((((status == lowerDriverReturn && s == IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && \old(customIrp) == customIrp) && NP + 4 <= MPR1) && compRegistered <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 532]: Loop Invariant Derived loop invariant: (((((((((((((!(myStatus == 259) && s == NP && 1 <= compRegistered) && !(ntStatus == 259)) || !(NP + 5 <= MPR3)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 1116]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 732]: Loop Invariant Derived loop invariant: (((((((((((!(\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))) || ((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && status == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || ((!(myStatus == 259) && s == NP && 1 <= compRegistered) && !(ntStatus == 259))) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: ((((((((((((((((!(NP + 5 <= MPR3) || ((((s == IPC && 0 == pended) && lowerDriverReturn == ntStatus) && IPC + SKIP1 <= s + \old(s)) && compRegistered <= 0)) || ((ntStatus + 1073741823 <= 0 && s == DC) && compRegistered <= 0)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(SKIP1 + 2 <= MPR1)) || !(\old(compRegistered) == 0)) || (((s == SKIP2 && 0 == pended) && lowerDriverReturn == ntStatus) && compRegistered <= 0)) || ((0 == pended && s == DC) && !(259 == ntStatus))) || ((((s == IPC && lowerDriverReturn == ntStatus) && \old(customIrp) == customIrp) && IPC + SKIP1 <= s + \old(s)) && compRegistered <= 0)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(\old(s) == NP)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || (((lowerDriverReturn == ntStatus && s == SKIP2) && \old(customIrp) == customIrp) && compRegistered <= 0)) || !(\old(customIrp) == 0) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(\old(compRegistered) == 0)) || !(0 == pended)) || ((0 == InterfaceType && !(myStatus == 259) && s == NP && 1 <= compRegistered) && !(ntStatus == 259))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 224]: 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))) || !(\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: 943]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MaximumInterfaceType <= 0)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) || !(customIrp == 0)) && (((((((((!(NP + 5 <= MPR3) || SKIP1 == s) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(customIrp == 0))) && ((((!(customIrp == 1) || (((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || !(MaximumInterfaceType <= 0)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637)))) && (((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(NP + 4 <= MPR1)) || SKIP1 == s) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC))) && (((((((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(myStatus == 0)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || !(customIrp == 0)) - InvariantResult [Line: 1094]: Loop Invariant Derived loop invariant: 1 - 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))) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || (((((0 == pended && 0 == compRegistered) && s == \old(s)) && 0 == ntStatus) && myStatus == \old(myStatus)) && \old(customIrp) == customIrp)) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0) - InvariantResult [Line: 855]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 229]: 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))) || !(\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: 732]: Loop Invariant Derived loop invariant: (((((((((((!(\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))) || ((((((((((((DC + 5 <= IPC && 0 == pended) && s == NP) && 0 == compRegistered) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && status == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && (myStatus == 0 || myStatus + 1073741637 == 0)) && \old(customIrp) == customIrp) && MaximumInterfaceType <= 0)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1072]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 834]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 757]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || ((((((((status == lowerDriverReturn && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered <= 0)) || !(\old(compRegistered) == 0)) || ((((((status == lowerDriverReturn && s == IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && compRegistered <= 0)) || (!(status == 259) && ((NP + DC + 7 <= IPC + SKIP1 && SKIP1 + 2 <= MPR1) && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) && NP + 4 <= MPR1)) || !(\old(s) == \old(MPR1))) || (status + 1073741738 <= 0 && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 900]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1035]: Loop Invariant Derived loop invariant: (((((((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || (s == \old(s) && \old(customIrp) == customIrp)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(\old(customIrp) == 0)) && ((((((((((!(\old(setEventCalled) == 1) || (s == NP && \old(customIrp) == customIrp)) || !(\old(customIrp) == 1)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(s) == MPR3)) || !(DC + 2 <= SKIP2)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637)))) && (((((((((((s == NP && \old(customIrp) == customIrp) || !(\old(setEventCalled) == 1)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(s) == MPR3)) || !(DC + 2 <= SKIP2)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) || !(\old(customIrp) == 0))) && (((((((((!(\old(setEventCalled) == 1) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(myStatus == 0)) || !(NP + 4 <= MPR1)) || ((!(NP + 5 <= MPR3) || !(0 == pended)) || !(1 <= compRegistered)) || !(DC + 5 <= IPC)) || !(\old(s) == MPR3)) || !(DC + 2 <= SKIP2)) || (s == NP && \old(customIrp) == customIrp)) || !(\old(customIrp) == 0)) - InvariantResult [Line: 703]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((status == lowerDriverReturn && s == IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && compRegistered <= 0) || !(\old(myStatus) == 0)) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((((((status == lowerDriverReturn && s == SKIP2) && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && \old(customIrp) == customIrp) && NP + 4 <= MPR1) && compRegistered <= 0)) || (((((((((status == lowerDriverReturn && s == SKIP2) && DC + 5 <= IPC) && 0 == pended) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && compRegistered <= 0)) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || ((((((((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC) && NP + DC + 7 <= IPC + SKIP1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(status == 259))) || !(\old(s) == \old(MPR1))) || (status + 1073741738 <= 0 && (((DC + 5 <= IPC && 0 == pended) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) || !(\old(s) == \old(NP))) || ((((((((DC + 5 <= IPC && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && status + 1073741823 <= 0) && SKIP1 + 2 <= MPR1) && s == DC) && NP + 4 <= MPR1) && compRegistered <= 0)) || (((((((((status == lowerDriverReturn && s == IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && SKIP1 + 2 <= MPR1) && \old(customIrp) == customIrp) && NP + 4 <= MPR1) && compRegistered <= 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: ((((((((((((((0 == pended && 0 == compRegistered) && s == \old(s)) && \old(customIrp) == customIrp) || !(NP + 5 <= MPR3)) || !(MaximumInterfaceType <= 0)) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || (!(\old(myStatus) == 0) && !(0 == \old(myStatus) + 1073741637))) || !(\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: 227]: 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))) || !(\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: 767]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || !(\old(MaximumInterfaceType) <= 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && compRegistered <= 0) || (NP + DC + 7 <= IPC + SKIP1 && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && !(status == 259))) || !(\old(compRegistered) == 0)) || ((((((status == lowerDriverReturn && DC + 5 <= IPC) && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && DC + 7 <= s) && compRegistered <= 0)) || !(\old(s) == \old(MPR1))) || (status + 1073741738 <= 0 && ((DC + 5 <= IPC && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && s == DC)) || (status == lowerDriverReturn && (SKIP2 <= s && ((((DC + 5 <= IPC && NP + 5 <= MPR3) && NP + DC + 7 <= IPC + SKIP1) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && compRegistered <= 0) && NP + 4 <= MPR1)) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(MaximumInterfaceType <= 0)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637))) || !(customIrp == 0)) && (((((((((!(NP + 5 <= MPR3) || SKIP1 == s) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(NP + 4 <= MPR1)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(customIrp == 0))) && ((((!(customIrp == 1) || (((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || !(MaximumInterfaceType <= 0)) || (!(myStatus == 0) && !(0 == myStatus + 1073741637)))) && (((((((((!(NP + 5 <= MPR3) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || !(NP + 4 <= MPR1)) || SKIP1 == s) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC))) && (((((((((((!(NP + 5 <= MPR3) || !(\old(s) == NP)) || !(SKIP1 + 2 <= MPR1)) || !(DC + NP + 7 <= SKIP1 + IPC)) || !(0 == pended)) || !(NP + 4 <= MPR1)) || !(1 <= compRegistered)) || !(DC + 2 <= SKIP2)) || !(DC + 5 <= IPC)) || !(myStatus == 0)) || ((((s == MPR1 && __cil_tmp7 <= 4294967296 * (__cil_tmp7 / 4294967296) + 3221225494) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 / 4294967296 + 1 <= 0) && setEventCalled == 1)) || !(customIrp == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 239 locations, 1 error locations. Result: SAFE, OverallTime: 35.7s, OverallIterations: 43, TraceHistogramMax: 2, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.9s, HoareTripleCheckerStatistics: 10123 SDtfs, 6343 SDslu, 27972 SDs, 0 SdLazy, 9038 SolverSat, 1645 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 728 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 98 LocationsWithAnnotation, 887 PreInvPairs, 1029 NumberOfFragments, 10858 HoareAnnotationTreeSize, 887 FomulaSimplifications, 64368 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 98 FomulaSimplificationsInter, 90269 FormulaSimplificationTreeSizeReductionInter, 16.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2487 NumberOfCodeBlocks, 2487 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2444 ConstructedInterpolants, 0 QuantifiedInterpolants, 330031 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 140/140 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...