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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:40,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:40,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:40,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:40,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:40,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:40,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:40,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:40,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:40,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:40,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:40,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:40,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:40,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:40,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:40,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:40,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:40,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:40,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:40,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:40,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:40,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:40,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:40,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:40,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:40,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:40,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:40,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:40,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:40,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:40,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:40,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:40,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:40,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:40,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:40,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:40,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:40,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:40,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:40,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:40,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:40,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:26:40,106 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:40,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:40,108 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:40,108 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:40,109 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:40,109 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:40,109 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:40,109 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:40,110 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:40,110 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:40,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:40,112 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:40,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:40,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:40,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:40,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:40,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:40,114 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:40,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:40,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:40,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:40,115 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:40,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:40,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:40,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:40,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:40,116 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:40,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:40,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:40,116 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:40,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:40,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:40,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:40,185 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:40,185 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:40,186 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-09-20 13:26:40,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9707adb1/c7c6c12a02da4370bac6d8083f0d2136/FLAG44284b475 [2019-09-20 13:26:40,843 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:40,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-2.c [2019-09-20 13:26:40,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9707adb1/c7c6c12a02da4370bac6d8083f0d2136/FLAG44284b475 [2019-09-20 13:26:41,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9707adb1/c7c6c12a02da4370bac6d8083f0d2136 [2019-09-20 13:26:41,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:41,164 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:41,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:41,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:41,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:41,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30898067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41, skipping insertion in model container [2019-09-20 13:26:41,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,182 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:41,243 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:41,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:41,626 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:41,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:41,768 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:41,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41 WrapperNode [2019-09-20 13:26:41,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:41,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:41,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:41,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:41,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,819 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:41,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:41,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:41,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:41,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:41,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 13:26:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 13:26:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-09-20 13:26:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 13:26:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 13:26:41,906 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 13:26:41,907 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 13:26:41,907 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 13:26:41,907 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-09-20 13:26:41,907 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-09-20 13:26:41,907 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-09-20 13:26:41,908 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-09-20 13:26:41,908 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-20 13:26:41,908 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-09-20 13:26:41,908 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 13:26:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:41,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:26:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:26:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:26:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-09-20 13:26:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 13:26:41,909 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 13:26:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 13:26:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-09-20 13:26:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-09-20 13:26:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-09-20 13:26:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-09-20 13:26:41,910 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-20 13:26:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-09-20 13:26:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 13:26:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 13:26:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 13:26:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 13:26:41,911 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 13:26:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:41,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:42,253 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,327 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-20 13:26:42,327 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-20 13:26:42,346 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,460 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-09-20 13:26:42,461 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-09-20 13:26:42,463 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,528 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-20 13:26:42,529 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-20 13:26:42,538 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,587 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-20 13:26:42,587 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-20 13:26:42,679 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,700 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 13:26:42,701 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 13:26:42,734 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,861 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-09-20 13:26:42,861 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-09-20 13:26:42,878 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:42,881 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:26:42,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:42 BoogieIcfgContainer [2019-09-20 13:26:42,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:42,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:42,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:42,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:42,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:41" (1/3) ... [2019-09-20 13:26:42,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4287a1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:42, skipping insertion in model container [2019-09-20 13:26:42,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (2/3) ... [2019-09-20 13:26:42,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4287a1e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:42, skipping insertion in model container [2019-09-20 13:26:42,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:42" (3/3) ... [2019-09-20 13:26:42,904 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-2.c [2019-09-20 13:26:42,915 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:42,926 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:42,943 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:42,975 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:42,975 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:42,975 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:42,976 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:42,976 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:42,976 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:42,976 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:42,977 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states. [2019-09-20 13:26:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:43,022 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,023 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,025 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1129426977, now seen corresponding path program 1 times [2019-09-20 13:26:43,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,342 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 3 states. [2019-09-20 13:26:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,462 INFO L93 Difference]: Finished difference Result 241 states and 345 transitions. [2019-09-20 13:26:43,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:43,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,478 INFO L225 Difference]: With dead ends: 241 [2019-09-20 13:26:43,479 INFO L226 Difference]: Without dead ends: 231 [2019-09-20 13:26:43,480 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-09-20 13:26:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-09-20 13:26:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-09-20 13:26:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 326 transitions. [2019-09-20 13:26:43,554 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 326 transitions. Word has length 20 [2019-09-20 13:26:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,555 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 326 transitions. [2019-09-20 13:26:43,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 326 transitions. [2019-09-20 13:26:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:43,557 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,557 INFO L407 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-09-20 13:26:43,557 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1811427322, now seen corresponding path program 1 times [2019-09-20 13:26:43,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,750 INFO L87 Difference]: Start difference. First operand 231 states and 326 transitions. Second operand 3 states. [2019-09-20 13:26:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,978 INFO L93 Difference]: Finished difference Result 315 states and 428 transitions. [2019-09-20 13:26:43,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,985 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:26:43,986 INFO L226 Difference]: Without dead ends: 314 [2019-09-20 13:26:43,990 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-20 13:26:44,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 298. [2019-09-20 13:26:44,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-20 13:26:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 408 transitions. [2019-09-20 13:26:44,042 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 408 transitions. Word has length 28 [2019-09-20 13:26:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,042 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 408 transitions. [2019-09-20 13:26:44,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 408 transitions. [2019-09-20 13:26:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:44,044 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,044 INFO L407 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-09-20 13:26:44,044 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash 439620198, now seen corresponding path program 1 times [2019-09-20 13:26:44,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,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-09-20 13:26:44,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,135 INFO L87 Difference]: Start difference. First operand 298 states and 408 transitions. Second operand 3 states. [2019-09-20 13:26:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,163 INFO L93 Difference]: Finished difference Result 362 states and 487 transitions. [2019-09-20 13:26:44,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:44,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,171 INFO L225 Difference]: With dead ends: 362 [2019-09-20 13:26:44,171 INFO L226 Difference]: Without dead ends: 362 [2019-09-20 13:26:44,172 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-20 13:26:44,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 338. [2019-09-20 13:26:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-20 13:26:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 459 transitions. [2019-09-20 13:26:44,221 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 459 transitions. Word has length 28 [2019-09-20 13:26:44,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,221 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 459 transitions. [2019-09-20 13:26:44,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 459 transitions. [2019-09-20 13:26:44,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 13:26:44,228 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,228 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,229 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1607848921, now seen corresponding path program 1 times [2019-09-20 13:26:44,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,331 INFO L87 Difference]: Start difference. First operand 338 states and 459 transitions. Second operand 3 states. [2019-09-20 13:26:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,414 INFO L93 Difference]: Finished difference Result 337 states and 456 transitions. [2019-09-20 13:26:44,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-09-20 13:26:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,418 INFO L225 Difference]: With dead ends: 337 [2019-09-20 13:26:44,418 INFO L226 Difference]: Without dead ends: 337 [2019-09-20 13:26:44,419 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-20 13:26:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2019-09-20 13:26:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-20 13:26:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 456 transitions. [2019-09-20 13:26:44,434 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 456 transitions. Word has length 38 [2019-09-20 13:26:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,434 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 456 transitions. [2019-09-20 13:26:44,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 456 transitions. [2019-09-20 13:26:44,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:26:44,438 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,438 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,438 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1742109340, now seen corresponding path program 1 times [2019-09-20 13:26:44,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:44,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:44,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:44,545 INFO L87 Difference]: Start difference. First operand 337 states and 456 transitions. Second operand 4 states. [2019-09-20 13:26:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,704 INFO L93 Difference]: Finished difference Result 319 states and 424 transitions. [2019-09-20 13:26:44,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:26:44,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-09-20 13:26:44,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,708 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:26:44,708 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:26:44,709 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:44,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:26:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 298. [2019-09-20 13:26:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-20 13:26:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 399 transitions. [2019-09-20 13:26:44,742 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 399 transitions. Word has length 46 [2019-09-20 13:26:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,742 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 399 transitions. [2019-09-20 13:26:44,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 399 transitions. [2019-09-20 13:26:44,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:26:44,744 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,745 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,745 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash 750041855, now seen corresponding path program 1 times [2019-09-20 13:26:44,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,797 INFO L87 Difference]: Start difference. First operand 298 states and 399 transitions. Second operand 3 states. [2019-09-20 13:26:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,818 INFO L93 Difference]: Finished difference Result 294 states and 392 transitions. [2019-09-20 13:26:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 13:26:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,821 INFO L225 Difference]: With dead ends: 294 [2019-09-20 13:26:44,821 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 13:26:44,822 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 13:26:44,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 264. [2019-09-20 13:26:44,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:26:44,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2019-09-20 13:26:44,832 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 45 [2019-09-20 13:26:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,832 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2019-09-20 13:26:44,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,833 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2019-09-20 13:26:44,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:26:44,834 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,834 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,835 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1784783245, now seen corresponding path program 1 times [2019-09-20 13:26:44,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,886 INFO L87 Difference]: Start difference. First operand 264 states and 357 transitions. Second operand 3 states. [2019-09-20 13:26:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,946 INFO L93 Difference]: Finished difference Result 280 states and 374 transitions. [2019-09-20 13:26:44,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-20 13:26:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,949 INFO L225 Difference]: With dead ends: 280 [2019-09-20 13:26:44,949 INFO L226 Difference]: Without dead ends: 242 [2019-09-20 13:26:44,949 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-09-20 13:26:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-09-20 13:26:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-20 13:26:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 321 transitions. [2019-09-20 13:26:44,959 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 321 transitions. Word has length 46 [2019-09-20 13:26:44,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,959 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 321 transitions. [2019-09-20 13:26:44,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 321 transitions. [2019-09-20 13:26:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:26:44,961 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,961 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,961 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1852297644, now seen corresponding path program 1 times [2019-09-20 13:26:44,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,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-09-20 13:26:45,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,016 INFO L87 Difference]: Start difference. First operand 242 states and 321 transitions. Second operand 3 states. [2019-09-20 13:26:45,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,081 INFO L93 Difference]: Finished difference Result 240 states and 317 transitions. [2019-09-20 13:26:45,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-20 13:26:45,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,084 INFO L225 Difference]: With dead ends: 240 [2019-09-20 13:26:45,084 INFO L226 Difference]: Without dead ends: 240 [2019-09-20 13:26:45,085 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-09-20 13:26:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-09-20 13:26:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-20 13:26:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 317 transitions. [2019-09-20 13:26:45,093 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 317 transitions. Word has length 53 [2019-09-20 13:26:45,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,094 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 317 transitions. [2019-09-20 13:26:45,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 317 transitions. [2019-09-20 13:26:45,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:26:45,095 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,096 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,096 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1745163498, now seen corresponding path program 1 times [2019-09-20 13:26:45,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:45,170 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:45,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:45,171 INFO L87 Difference]: Start difference. First operand 240 states and 317 transitions. Second operand 8 states. [2019-09-20 13:26:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,320 INFO L93 Difference]: Finished difference Result 249 states and 326 transitions. [2019-09-20 13:26:45,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:45,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-09-20 13:26:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,322 INFO L225 Difference]: With dead ends: 249 [2019-09-20 13:26:45,322 INFO L226 Difference]: Without dead ends: 211 [2019-09-20 13:26:45,323 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:26:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-20 13:26:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-09-20 13:26:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-20 13:26:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 277 transitions. [2019-09-20 13:26:45,335 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 277 transitions. Word has length 51 [2019-09-20 13:26:45,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,336 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 277 transitions. [2019-09-20 13:26:45,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 277 transitions. [2019-09-20 13:26:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:26:45,337 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,337 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,338 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,338 INFO L82 PathProgramCache]: Analyzing trace with hash 143486070, now seen corresponding path program 1 times [2019-09-20 13:26:45,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:26:45,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:26:45,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:26:45,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:26:45,441 INFO L87 Difference]: Start difference. First operand 211 states and 277 transitions. Second operand 9 states. [2019-09-20 13:26:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,620 INFO L93 Difference]: Finished difference Result 224 states and 290 transitions. [2019-09-20 13:26:45,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:26:45,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-09-20 13:26:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,623 INFO L225 Difference]: With dead ends: 224 [2019-09-20 13:26:45,623 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:26:45,623 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:26:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:26:45,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-09-20 13:26:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-20 13:26:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 270 transitions. [2019-09-20 13:26:45,632 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 270 transitions. Word has length 52 [2019-09-20 13:26:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,633 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 270 transitions. [2019-09-20 13:26:45,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:26:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2019-09-20 13:26:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:26:45,634 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,634 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,635 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1278878233, now seen corresponding path program 1 times [2019-09-20 13:26:45,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,705 INFO L87 Difference]: Start difference. First operand 206 states and 270 transitions. Second operand 3 states. [2019-09-20 13:26:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,721 INFO L93 Difference]: Finished difference Result 207 states and 270 transitions. [2019-09-20 13:26:45,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-20 13:26:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,725 INFO L225 Difference]: With dead ends: 207 [2019-09-20 13:26:45,725 INFO L226 Difference]: Without dead ends: 205 [2019-09-20 13:26:45,726 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-20 13:26:45,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-09-20 13:26:45,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-20 13:26:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 265 transitions. [2019-09-20 13:26:45,733 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 265 transitions. Word has length 58 [2019-09-20 13:26:45,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,733 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 265 transitions. [2019-09-20 13:26:45,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,733 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 265 transitions. [2019-09-20 13:26:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-20 13:26:45,735 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,735 INFO L407 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-09-20 13:26:45,735 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,735 INFO L82 PathProgramCache]: Analyzing trace with hash 85703434, now seen corresponding path program 1 times [2019-09-20 13:26:45,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,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-09-20 13:26:45,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:26:45,839 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:26:45,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:26:45,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:26:45,842 INFO L87 Difference]: Start difference. First operand 205 states and 265 transitions. Second operand 10 states. [2019-09-20 13:26:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,026 INFO L93 Difference]: Finished difference Result 214 states and 274 transitions. [2019-09-20 13:26:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:26:46,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-09-20 13:26:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,028 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:26:46,028 INFO L226 Difference]: Without dead ends: 179 [2019-09-20 13:26:46,029 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:26:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-20 13:26:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-09-20 13:26:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-20 13:26:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 227 transitions. [2019-09-20 13:26:46,037 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 227 transitions. Word has length 59 [2019-09-20 13:26:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,037 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 227 transitions. [2019-09-20 13:26:46,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:26:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 227 transitions. [2019-09-20 13:26:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:26:46,043 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,043 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,043 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1933570889, now seen corresponding path program 1 times [2019-09-20 13:26:46,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:26:46,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:26:46,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:26:46,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:26:46,153 INFO L87 Difference]: Start difference. First operand 179 states and 227 transitions. Second operand 10 states. [2019-09-20 13:26:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,311 INFO L93 Difference]: Finished difference Result 188 states and 236 transitions. [2019-09-20 13:26:46,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:26:46,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-09-20 13:26:46,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,313 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:26:46,313 INFO L226 Difference]: Without dead ends: 177 [2019-09-20 13:26:46,314 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:26:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-20 13:26:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-09-20 13:26:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-20 13:26:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2019-09-20 13:26:46,323 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 54 [2019-09-20 13:26:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,323 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2019-09-20 13:26:46,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:26:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2019-09-20 13:26:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:26:46,324 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,324 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,324 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,325 INFO L82 PathProgramCache]: Analyzing trace with hash -309007876, now seen corresponding path program 1 times [2019-09-20 13:26:46,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:46,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:46,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:46,404 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand 8 states. [2019-09-20 13:26:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,691 INFO L93 Difference]: Finished difference Result 263 states and 321 transitions. [2019-09-20 13:26:46,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:46,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-09-20 13:26:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,694 INFO L225 Difference]: With dead ends: 263 [2019-09-20 13:26:46,694 INFO L226 Difference]: Without dead ends: 249 [2019-09-20 13:26:46,695 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:26:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-20 13:26:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 187. [2019-09-20 13:26:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-09-20 13:26:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 237 transitions. [2019-09-20 13:26:46,703 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 237 transitions. Word has length 53 [2019-09-20 13:26:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,704 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 237 transitions. [2019-09-20 13:26:46,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 237 transitions. [2019-09-20 13:26:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:26:46,709 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,709 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,710 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1433722057, now seen corresponding path program 1 times [2019-09-20 13:26:46,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:26:46,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:26:46,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:26:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:26:46,788 INFO L87 Difference]: Start difference. First operand 187 states and 237 transitions. Second operand 9 states. [2019-09-20 13:26:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,944 INFO L93 Difference]: Finished difference Result 200 states and 250 transitions. [2019-09-20 13:26:46,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:26:46,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-09-20 13:26:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,947 INFO L225 Difference]: With dead ends: 200 [2019-09-20 13:26:46,948 INFO L226 Difference]: Without dead ends: 165 [2019-09-20 13:26:46,948 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:26:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-20 13:26:46,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-09-20 13:26:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-20 13:26:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 194 transitions. [2019-09-20 13:26:46,956 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 194 transitions. Word has length 53 [2019-09-20 13:26:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,956 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 194 transitions. [2019-09-20 13:26:46,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:26:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 194 transitions. [2019-09-20 13:26:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:26:46,958 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,959 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,959 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1317699651, now seen corresponding path program 1 times [2019-09-20 13:26:46,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:47,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:26:47,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:26:47,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:26:47,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:26:47,130 INFO L87 Difference]: Start difference. First operand 165 states and 194 transitions. Second operand 10 states. [2019-09-20 13:26:47,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,800 INFO L93 Difference]: Finished difference Result 237 states and 271 transitions. [2019-09-20 13:26:47,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-20 13:26:47,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-09-20 13:26:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,802 INFO L225 Difference]: With dead ends: 237 [2019-09-20 13:26:47,803 INFO L226 Difference]: Without dead ends: 237 [2019-09-20 13:26:47,803 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:26:47,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-20 13:26:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 188. [2019-09-20 13:26:47,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-20 13:26:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 218 transitions. [2019-09-20 13:26:47,814 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 218 transitions. Word has length 54 [2019-09-20 13:26:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,815 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 218 transitions. [2019-09-20 13:26:47,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:26:47,815 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 218 transitions. [2019-09-20 13:26:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-20 13:26:47,818 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,818 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:47,818 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1204113239, now seen corresponding path program 1 times [2019-09-20 13:26:47,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:47,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:47,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:47,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:47,887 INFO L87 Difference]: Start difference. First operand 188 states and 218 transitions. Second operand 6 states. [2019-09-20 13:26:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,928 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2019-09-20 13:26:47,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:47,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-20 13:26:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,931 INFO L225 Difference]: With dead ends: 203 [2019-09-20 13:26:47,931 INFO L226 Difference]: Without dead ends: 196 [2019-09-20 13:26:47,931 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-20 13:26:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 190. [2019-09-20 13:26:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:26:47,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2019-09-20 13:26:47,939 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 57 [2019-09-20 13:26:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,939 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2019-09-20 13:26:47,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2019-09-20 13:26:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-20 13:26:47,941 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,941 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:47,941 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash -527681510, now seen corresponding path program 1 times [2019-09-20 13:26:47,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:48,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:48,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:48,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:48,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:48,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:48,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:48,029 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand 6 states. [2019-09-20 13:26:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:48,086 INFO L93 Difference]: Finished difference Result 194 states and 224 transitions. [2019-09-20 13:26:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:48,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-20 13:26:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:48,088 INFO L225 Difference]: With dead ends: 194 [2019-09-20 13:26:48,089 INFO L226 Difference]: Without dead ends: 194 [2019-09-20 13:26:48,090 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-09-20 13:26:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-09-20 13:26:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-09-20 13:26:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2019-09-20 13:26:48,102 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 57 [2019-09-20 13:26:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:48,103 INFO L475 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2019-09-20 13:26:48,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2019-09-20 13:26:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:26:48,104 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:48,104 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:48,105 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1222442102, now seen corresponding path program 1 times [2019-09-20 13:26:48,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:48,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:48,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:26:48,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:48,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:26:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:26:48,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:26:48,233 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand 9 states. [2019-09-20 13:26:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:48,751 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2019-09-20 13:26:48,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-20 13:26:48,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-09-20 13:26:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:48,753 INFO L225 Difference]: With dead ends: 203 [2019-09-20 13:26:48,753 INFO L226 Difference]: Without dead ends: 203 [2019-09-20 13:26:48,753 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:26:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-20 13:26:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 168. [2019-09-20 13:26:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-20 13:26:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 194 transitions. [2019-09-20 13:26:48,759 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 194 transitions. Word has length 55 [2019-09-20 13:26:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:48,760 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 194 transitions. [2019-09-20 13:26:48,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:26:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 194 transitions. [2019-09-20 13:26:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:26:48,761 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:48,761 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:48,761 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:48,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash -639520605, now seen corresponding path program 1 times [2019-09-20 13:26:48,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:48,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:48,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:48,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:48,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:48,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:48,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:48,854 INFO L87 Difference]: Start difference. First operand 168 states and 194 transitions. Second operand 5 states. [2019-09-20 13:26:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:48,866 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2019-09-20 13:26:48,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:48,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-20 13:26:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:48,868 INFO L225 Difference]: With dead ends: 162 [2019-09-20 13:26:48,868 INFO L226 Difference]: Without dead ends: 162 [2019-09-20 13:26:48,868 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-20 13:26:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-09-20 13:26:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-20 13:26:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 185 transitions. [2019-09-20 13:26:48,874 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 185 transitions. Word has length 58 [2019-09-20 13:26:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:48,875 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 185 transitions. [2019-09-20 13:26:48,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 185 transitions. [2019-09-20 13:26:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:26:48,877 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:48,877 INFO L407 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] [2019-09-20 13:26:48,877 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:48,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:48,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1656625880, now seen corresponding path program 1 times [2019-09-20 13:26:48,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:26:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 13:26:48,993 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-20 13:26:49,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:26:49 BoogieIcfgContainer [2019-09-20 13:26:49,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:26:49,123 INFO L168 Benchmark]: Toolchain (without parser) took 7958.21 ms. Allocated memory was 132.1 MB in the beginning and 330.8 MB in the end (delta: 198.7 MB). Free memory was 87.1 MB in the beginning and 162.2 MB in the end (delta: -75.2 MB). Peak memory consumption was 123.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:49,124 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-20 13:26:49,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 604.95 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 86.7 MB in the beginning and 167.7 MB in the end (delta: -81.0 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:49,126 INFO L168 Benchmark]: Boogie Preprocessor took 72.25 ms. Allocated memory is still 199.2 MB. Free memory was 167.7 MB in the beginning and 163.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:49,126 INFO L168 Benchmark]: RCFGBuilder took 1042.22 ms. Allocated memory is still 199.2 MB. Free memory was 163.6 MB in the beginning and 93.3 MB in the end (delta: 70.3 MB). Peak memory consumption was 70.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:49,127 INFO L168 Benchmark]: TraceAbstraction took 6234.34 ms. Allocated memory was 199.2 MB in the beginning and 330.8 MB in the end (delta: 131.6 MB). Free memory was 93.3 MB in the beginning and 162.2 MB in the end (delta: -69.0 MB). Peak memory consumption was 62.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:49,131 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 604.95 ms. Allocated memory was 132.1 MB in the beginning and 199.2 MB in the end (delta: 67.1 MB). Free memory was 86.7 MB in the beginning and 167.7 MB in the end (delta: -81.0 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.25 ms. Allocated memory is still 199.2 MB. Free memory was 167.7 MB in the beginning and 163.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1042.22 ms. Allocated memory is still 199.2 MB. Free memory was 163.6 MB in the beginning and 93.3 MB in the end (delta: 70.3 MB). Peak memory consumption was 70.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6234.34 ms. Allocated memory was 199.2 MB in the beginning and 330.8 MB in the end (delta: 131.6 MB). Free memory was 93.3 MB in the beginning and 162.2 MB in the end (delta: -69.0 MB). Peak memory consumption was 62.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1012]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] int KernelMode ; [L23] int Executive ; [L24] int DevicePowerState ; [L25] int s ; [L26] int UNLOADED ; [L27] int NP ; [L28] int DC ; [L29] int SKIP1 ; [L30] int SKIP2 ; [L31] int MPR1 ; [L32] int MPR3 ; [L33] int IPC ; [L34] int pended ; [L35] int compFptr ; [L36] int compRegistered ; [L37] int lowerDriverReturn ; [L38] int setEventCalled ; [L39] int customIrp ; [L40] int myStatus ; VAL [\old(compFptr)=19, \old(compRegistered)=11, \old(customIrp)=14, \old(DC)=7, \old(DevicePowerState)=20, \old(Executive)=12, \old(IPC)=8, \old(KernelMode)=24, \old(lowerDriverReturn)=22, \old(MPR1)=18, \old(MPR3)=16, \old(myStatus)=21, \old(NP)=13, \old(pended)=23, \old(s)=9, \old(setEventCalled)=17, \old(SKIP1)=15, \old(SKIP2)=10, \old(UNLOADED)=6, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L293] int status ; [L294] int irp = __VERIFIER_nondet_int() ; [L295] int pirp ; [L296] int pirp__IoStatus__Status ; [L297] int irp_choice = __VERIFIER_nondet_int() ; [L298] int devobj = __VERIFIER_nondet_int() ; [L299] int __cil_tmp8 ; [L301] KernelMode = 0 [L302] Executive = 0 [L303] DevicePowerState = 1 [L304] s = 0 [L305] UNLOADED = 0 [L306] NP = 0 [L307] DC = 0 [L308] SKIP1 = 0 [L309] SKIP2 = 0 [L310] MPR1 = 0 [L311] MPR3 = 0 [L312] IPC = 0 [L313] pended = 0 [L314] compFptr = 0 [L315] compRegistered = 0 [L316] lowerDriverReturn = 0 [L317] setEventCalled = 0 [L318] customIrp = 0 [L319] myStatus = 0 [L323] status = 0 [L324] pirp = irp VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=1, devobj=0, Executive=0, IPC=0, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, status=0, UNLOADED=0] [L325] CALL _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=0, DevicePowerState=1, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, UNLOADED=0] [L60] UNLOADED = 0 [L61] NP = 1 [L62] DC = 2 [L63] SKIP1 = 3 [L64] SKIP2 = 4 [L65] MPR1 = 5 [L66] MPR3 = 6 [L67] IPC = 7 [L68] s = UNLOADED [L69] pended = 0 [L70] compFptr = 0 [L71] compRegistered = 0 [L72] lowerDriverReturn = 0 [L73] setEventCalled = 0 [L74] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L325] RET _BLAST_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L327] COND TRUE status >= 0 [L328] s = NP [L329] customIrp = 0 [L330] setEventCalled = customIrp [L331] lowerDriverReturn = setEventCalled [L332] compRegistered = lowerDriverReturn [L333] pended = compRegistered [L334] pirp__IoStatus__Status = 0 [L335] myStatus = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L336] COND FALSE !(irp_choice == 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L341] CALL stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L46] s = NP [L47] pended = 0 [L48] compFptr = 0 [L49] compRegistered = 0 [L50] lowerDriverReturn = 0 [L51] setEventCalled = 0 [L52] customIrp = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L341] RET stub_driver_init() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L344] COND FALSE !(status < 0) [L348] int tmp_ndt_1; [L349] tmp_ndt_1 = __VERIFIER_nondet_int() [L350] COND FALSE !(tmp_ndt_1 == 0) [L353] int tmp_ndt_2; [L354] tmp_ndt_2 = __VERIFIER_nondet_int() [L355] COND FALSE !(tmp_ndt_2 == 1) [L358] int tmp_ndt_3; [L359] tmp_ndt_3 = __VERIFIER_nondet_int() [L360] COND TRUE tmp_ndt_3 == 3 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L387] CALL, EXPR KbFilter_PnP(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L79] int devExt ; [L80] int irpStack ; [L81] int status ; [L82] int event = __VERIFIER_nondet_int() ; [L83] int DeviceObject__DeviceExtension = __VERIFIER_nondet_int() ; [L84] int Irp__Tail__Overlay__CurrentStackLocation = __VERIFIER_nondet_int() ; [L85] int irpStack__MinorFunction = __VERIFIER_nondet_int() ; [L86] int devExt__TopOfStack = __VERIFIER_nondet_int() ; [L87] int devExt__Started ; [L88] int devExt__Removed ; [L89] int devExt__SurpriseRemoved ; [L90] int Irp__IoStatus__Status ; [L91] int Irp__IoStatus__Information ; [L92] int Irp__CurrentLocation = __VERIFIER_nondet_int() ; [L93] int irpSp ; [L94] int nextIrpSp ; [L95] int nextIrpSp__Control ; [L96] int irpSp___0 ; [L97] int irpSp__Context ; [L98] int irpSp__Control ; [L99] long __cil_tmp23 ; [L102] status = 0 [L103] devExt = DeviceObject__DeviceExtension [L104] irpStack = Irp__Tail__Overlay__CurrentStackLocation VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L105] COND FALSE !(irpStack__MinorFunction == 0) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L108] COND FALSE !(irpStack__MinorFunction == 23) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L111] COND TRUE irpStack__MinorFunction == 2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L235] devExt__Removed = 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L236] COND TRUE s == NP [L237] s = SKIP1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=0, Irp__Tail__Overlay__CurrentStackLocation=0, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L244] Irp__CurrentLocation ++ [L245] Irp__Tail__Overlay__CurrentStackLocation ++ VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L246] CALL IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L482] int returnVal2 ; [L483] int compRetStatus ; [L484] int lcontext = __VERIFIER_nondet_int() ; [L485] long long __cil_tmp7 ; VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L488] COND FALSE !(\read(compRegistered)) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L501] int tmp_ndt_6; [L502] tmp_ndt_6 = __VERIFIER_nondet_int() [L503] COND FALSE !(tmp_ndt_6 == 0) [L506] int tmp_ndt_7; [L507] tmp_ndt_7 = __VERIFIER_nondet_int() [L508] COND TRUE tmp_ndt_7 == 1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L517] returnVal2 = -1073741823 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L527] COND FALSE !(s == NP) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L531] COND FALSE !(s == MPR1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=3, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L540] COND TRUE s == SKIP1 [L541] s = SKIP2 [L542] lowerDriverReturn = returnVal2 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L550] return (returnVal2); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=3, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, \result=-1073741823, compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceObject=0, DevicePowerState=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lcontext=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, returnVal2=-1073741823, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, tmp_ndt_6=1, tmp_ndt_7=1, UNLOADED=0] [L246] RET IofCallDriver(devExt__TopOfStack, Irp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IofCallDriver(devExt__TopOfStack, Irp)=-1073741823, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L247] status = 0 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L289] return (status); VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DeviceObject)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(Irp)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, \result=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, devExt=0, devExt__Removed=1, devExt__TopOfStack=0, DeviceObject=0, DeviceObject__DeviceExtension=0, DevicePowerState=1, event=0, Executive=0, IPC=7, Irp=0, Irp__CurrentLocation=1, Irp__Tail__Overlay__CurrentStackLocation=1, irpStack=0, irpStack__MinorFunction=2, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, UNLOADED=0] [L387] RET, EXPR KbFilter_PnP(devobj, pirp) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KbFilter_PnP(devobj, pirp)=0, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L387] status = KbFilter_PnP(devobj, pirp) [L411] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L419] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L427] COND TRUE s != UNLOADED VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L428] COND TRUE status != -1 VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L429] COND FALSE !(s != SKIP2) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L439] COND FALSE !(pended == 1) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L446] COND FALSE !(s == DC) VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L451] COND TRUE status != lowerDriverReturn VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=1, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, tmp_ndt_1=1, tmp_ndt_2=0, tmp_ndt_3=3, UNLOADED=0] [L452] CALL errorFn() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] [L1012] __VERIFIER_error() VAL [\old(compFptr)=0, \old(compRegistered)=0, \old(customIrp)=0, \old(DC)=0, \old(DevicePowerState)=0, \old(Executive)=0, \old(IPC)=0, \old(KernelMode)=0, \old(lowerDriverReturn)=0, \old(MPR1)=0, \old(MPR3)=0, \old(myStatus)=0, \old(NP)=0, \old(pended)=0, \old(s)=0, \old(setEventCalled)=0, \old(SKIP1)=0, \old(SKIP2)=0, \old(UNLOADED)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, DevicePowerState=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=-1073741823, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, s=4, setEventCalled=0, SKIP1=3, SKIP2=4, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 240 locations, 1 error locations. UNSAFE Result, 6.1s OverallTime, 21 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4785 SDtfs, 2297 SDslu, 12277 SDs, 0 SdLazy, 2285 SolverSat, 356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 246 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1021 NumberOfCodeBlocks, 1021 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 945 ConstructedInterpolants, 0 QuantifiedInterpolants, 81101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...