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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:46:34,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:46:34,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:46:34,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:46:34,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:46:34,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:46:34,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:46:34,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:46:34,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:46:34,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:46:34,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:46:34,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:46:34,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:46:34,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:46:34,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:46:34,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:46:34,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:46:34,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:46:34,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:46:34,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:46:34,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:46:34,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:46:34,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:46:34,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:46:34,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:46:34,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:46:34,259 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:46:34,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:46:34,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:46:34,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:46:34,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:46:34,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:46:34,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:46:34,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:46:34,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:46:34,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:46:34,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:46:34,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:46:34,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:46:34,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:46:34,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:46:34,271 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-09 05:46:34,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:46:34,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:46:34,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:46:34,292 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:46:34,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:46:34,293 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:46:34,293 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:46:34,294 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:46:34,294 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:46:34,294 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:46:34,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:46:34,295 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:46:34,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:46:34,296 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:46:34,296 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:46:34,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:46:34,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:46:34,296 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:46:34,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:46:34,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:46:34,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:46:34,297 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:46:34,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:46:34,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:46:34,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:46:34,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:46:34,298 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:46:34,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:46:34,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:46:34,299 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:46:34,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:46:34,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:46:34,346 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:46:34,348 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:46:34,348 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:46:34,349 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-09-09 05:46:34,425 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b441abe28/c7f5e3abf727426aa9b4a6aaaccd007e/FLAG8bfc1266f [2019-09-09 05:46:34,941 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:46:34,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-09-09 05:46:34,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b441abe28/c7f5e3abf727426aa9b4a6aaaccd007e/FLAG8bfc1266f [2019-09-09 05:46:35,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b441abe28/c7f5e3abf727426aa9b4a6aaaccd007e [2019-09-09 05:46:35,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:46:35,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:46:35,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:46:35,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:46:35,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:46:35,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:46:35" (1/1) ... [2019-09-09 05:46:35,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11da6c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35, skipping insertion in model container [2019-09-09 05:46:35,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:46:35" (1/1) ... [2019-09-09 05:46:35,276 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:46:35,333 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:46:35,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:46:35,774 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:46:35,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:46:35,886 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:46:35,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35 WrapperNode [2019-09-09 05:46:35,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:46:35,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:46:35,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:46:35,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:46:35,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35" (1/1) ... [2019-09-09 05:46:35,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35" (1/1) ... [2019-09-09 05:46:35,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35" (1/1) ... [2019-09-09 05:46:35,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35" (1/1) ... [2019-09-09 05:46:35,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35" (1/1) ... [2019-09-09 05:46:35,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35" (1/1) ... [2019-09-09 05:46:35,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35" (1/1) ... [2019-09-09 05:46:35,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:46:35,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:46:35,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:46:35,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:46:35,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35" (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-09 05:46:36,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:46:36,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:46:36,065 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-09 05:46:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-09 05:46:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2019-09-09 05:46:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:46:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-09 05:46:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-09 05:46:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-09 05:46:36,066 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-09 05:46:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-09 05:46:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2019-09-09 05:46:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2019-09-09 05:46:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2019-09-09 05:46:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2019-09-09 05:46:36,067 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-09 05:46:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2019-09-09 05:46:36,068 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-09 05:46:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:46:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:46:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:46:36,068 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:46:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:46:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-09 05:46:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2019-09-09 05:46:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-09 05:46:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-09 05:46:36,069 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-09 05:46:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2019-09-09 05:46:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2019-09-09 05:46:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2019-09-09 05:46:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2019-09-09 05:46:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2019-09-09 05:46:36,070 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-09 05:46:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-09 05:46:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-09 05:46:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-09 05:46:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:46:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-09 05:46:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:46:36,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:46:36,373 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:36,436 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-09 05:46:36,436 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-09 05:46:36,464 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:36,596 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-09-09 05:46:36,596 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-09-09 05:46:36,598 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:36,636 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-09 05:46:36,637 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-09 05:46:36,643 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:36,711 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-09-09 05:46:36,711 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-09-09 05:46:36,825 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:36,843 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-09 05:46:36,843 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-09 05:46:36,868 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:46:36,970 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2019-09-09 05:46:36,971 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2019-09-09 05:46:36,979 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:46:36,979 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-09 05:46:36,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:46:36 BoogieIcfgContainer [2019-09-09 05:46:36,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:46:36,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:46:36,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:46:36,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:46:36,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:46:35" (1/3) ... [2019-09-09 05:46:36,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b022a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:46:36, skipping insertion in model container [2019-09-09 05:46:36,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:46:35" (2/3) ... [2019-09-09 05:46:36,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b022a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:46:36, skipping insertion in model container [2019-09-09 05:46:36,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:46:36" (3/3) ... [2019-09-09 05:46:36,990 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-09-09 05:46:37,000 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:46:37,009 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:46:37,027 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:46:37,056 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:46:37,056 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:46:37,056 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:46:37,057 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:46:37,057 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:46:37,057 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:46:37,057 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:46:37,058 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:46:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2019-09-09 05:46:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:46:37,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:37,098 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:37,101 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:37,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1712773315, now seen corresponding path program 1 times [2019-09-09 05:46:37,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:37,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:37,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:37,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:37,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:37,336 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-09 05:46:37,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:37,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:37,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:37,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:37,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:37,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:37,366 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 3 states. [2019-09-09 05:46:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:37,519 INFO L93 Difference]: Finished difference Result 240 states and 344 transitions. [2019-09-09 05:46:37,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:37,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:46:37,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:37,549 INFO L225 Difference]: With dead ends: 240 [2019-09-09 05:46:37,549 INFO L226 Difference]: Without dead ends: 228 [2019-09-09 05:46:37,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-09 05:46:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-09-09 05:46:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-09 05:46:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2019-09-09 05:46:37,625 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2019-09-09 05:46:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:37,626 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2019-09-09 05:46:37,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2019-09-09 05:46:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:46:37,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:37,628 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:37,629 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1840561730, now seen corresponding path program 1 times [2019-09-09 05:46:37,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:37,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:37,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:37,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:37,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:37,799 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-09 05:46:37,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:37,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:37,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:37,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:37,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:37,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:37,802 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand 3 states. [2019-09-09 05:46:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,008 INFO L93 Difference]: Finished difference Result 309 states and 420 transitions. [2019-09-09 05:46:38,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:38,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:46:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,013 INFO L225 Difference]: With dead ends: 309 [2019-09-09 05:46:38,014 INFO L226 Difference]: Without dead ends: 308 [2019-09-09 05:46:38,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-09 05:46:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 295. [2019-09-09 05:46:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-09 05:46:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 404 transitions. [2019-09-09 05:46:38,068 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 404 transitions. Word has length 28 [2019-09-09 05:46:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,069 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 404 transitions. [2019-09-09 05:46:38,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 404 transitions. [2019-09-09 05:46:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:46:38,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,071 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,071 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,071 INFO L82 PathProgramCache]: Analyzing trace with hash -919522484, now seen corresponding path program 1 times [2019-09-09 05:46:38,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:38,198 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-09 05:46:38,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:38,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:38,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:38,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:38,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:38,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,200 INFO L87 Difference]: Start difference. First operand 295 states and 404 transitions. Second operand 3 states. [2019-09-09 05:46:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,238 INFO L93 Difference]: Finished difference Result 356 states and 479 transitions. [2019-09-09 05:46:38,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:38,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:46:38,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,247 INFO L225 Difference]: With dead ends: 356 [2019-09-09 05:46:38,247 INFO L226 Difference]: Without dead ends: 356 [2019-09-09 05:46:38,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-09 05:46:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 335. [2019-09-09 05:46:38,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-09 05:46:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2019-09-09 05:46:38,295 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 28 [2019-09-09 05:46:38,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,296 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2019-09-09 05:46:38,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2019-09-09 05:46:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-09 05:46:38,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,303 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1823384951, now seen corresponding path program 1 times [2019-09-09 05:46:38,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:38,404 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-09 05:46:38,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:38,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:38,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:38,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:38,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:38,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,407 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand 3 states. [2019-09-09 05:46:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,483 INFO L93 Difference]: Finished difference Result 334 states and 452 transitions. [2019-09-09 05:46:38,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:38,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-09-09 05:46:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,486 INFO L225 Difference]: With dead ends: 334 [2019-09-09 05:46:38,486 INFO L226 Difference]: Without dead ends: 334 [2019-09-09 05:46:38,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-09 05:46:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2019-09-09 05:46:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-09 05:46:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 452 transitions. [2019-09-09 05:46:38,501 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 452 transitions. Word has length 38 [2019-09-09 05:46:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,501 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 452 transitions. [2019-09-09 05:46:38,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 452 transitions. [2019-09-09 05:46:38,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-09 05:46:38,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,504 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,505 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1946925920, now seen corresponding path program 1 times [2019-09-09 05:46:38,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:38,566 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-09 05:46:38,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:38,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:46:38,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:38,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:46:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:46:38,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:38,569 INFO L87 Difference]: Start difference. First operand 334 states and 452 transitions. Second operand 4 states. [2019-09-09 05:46:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,705 INFO L93 Difference]: Finished difference Result 313 states and 416 transitions. [2019-09-09 05:46:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:46:38,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-09-09 05:46:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,708 INFO L225 Difference]: With dead ends: 313 [2019-09-09 05:46:38,708 INFO L226 Difference]: Without dead ends: 313 [2019-09-09 05:46:38,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:46:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-09 05:46:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 295. [2019-09-09 05:46:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-09-09 05:46:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 395 transitions. [2019-09-09 05:46:38,723 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 395 transitions. Word has length 46 [2019-09-09 05:46:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,724 INFO L475 AbstractCegarLoop]: Abstraction has 295 states and 395 transitions. [2019-09-09 05:46:38,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:46:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 395 transitions. [2019-09-09 05:46:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-09 05:46:38,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,726 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1615603168, now seen corresponding path program 1 times [2019-09-09 05:46:38,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:38,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:38,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:38,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:38,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,802 INFO L87 Difference]: Start difference. First operand 295 states and 395 transitions. Second operand 3 states. [2019-09-09 05:46:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,825 INFO L93 Difference]: Finished difference Result 291 states and 388 transitions. [2019-09-09 05:46:38,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:38,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-09 05:46:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,828 INFO L225 Difference]: With dead ends: 291 [2019-09-09 05:46:38,828 INFO L226 Difference]: Without dead ends: 102 [2019-09-09 05:46:38,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-09 05:46:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-09 05:46:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-09 05:46:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2019-09-09 05:46:38,835 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 45 [2019-09-09 05:46:38,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,836 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2019-09-09 05:46:38,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2019-09-09 05:46:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-09 05:46:38,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,838 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,839 INFO L82 PathProgramCache]: Analyzing trace with hash -582629432, now seen corresponding path program 1 times [2019-09-09 05:46:38,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:38,898 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-09 05:46:38,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:38,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:38,899 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:38,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:38,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:38,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,901 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand 3 states. [2019-09-09 05:46:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:38,931 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-09-09 05:46:38,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:38,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-09 05:46:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:38,935 INFO L225 Difference]: With dead ends: 100 [2019-09-09 05:46:38,935 INFO L226 Difference]: Without dead ends: 100 [2019-09-09 05:46:38,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:38,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-09 05:46:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-09-09 05:46:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-09 05:46:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2019-09-09 05:46:38,940 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2019-09-09 05:46:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:38,941 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2019-09-09 05:46:38,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2019-09-09 05:46:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:46:38,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:38,943 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:38,944 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:38,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:38,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1306380805, now seen corresponding path program 1 times [2019-09-09 05:46:38,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:38,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,019 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-09 05:46:39,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:39,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:39,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:39,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:39,023 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 6 states. [2019-09-09 05:46:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,072 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2019-09-09 05:46:39,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:39,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-09 05:46:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,076 INFO L225 Difference]: With dead ends: 118 [2019-09-09 05:46:39,076 INFO L226 Difference]: Without dead ends: 111 [2019-09-09 05:46:39,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:39,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-09 05:46:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2019-09-09 05:46:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-09-09 05:46:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2019-09-09 05:46:39,082 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2019-09-09 05:46:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:39,082 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2019-09-09 05:46:39,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2019-09-09 05:46:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-09 05:46:39,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:39,083 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:39,084 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:39,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:39,084 INFO L82 PathProgramCache]: Analyzing trace with hash -538994442, now seen corresponding path program 1 times [2019-09-09 05:46:39,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:39,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:39,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,148 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-09 05:46:39,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:39,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:39,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:39,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:39,153 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand 6 states. [2019-09-09 05:46:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,212 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-09-09 05:46:39,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:39,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-09-09 05:46:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,215 INFO L225 Difference]: With dead ends: 109 [2019-09-09 05:46:39,215 INFO L226 Difference]: Without dead ends: 109 [2019-09-09 05:46:39,216 INFO L628 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-09 05:46:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-09 05:46:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-09-09 05:46:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-09 05:46:39,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-09-09 05:46:39,222 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2019-09-09 05:46:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:39,222 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-09-09 05:46:39,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-09-09 05:46:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 05:46:39,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:39,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:39,224 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash -914264427, now seen corresponding path program 1 times [2019-09-09 05:46:39,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:39,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:39,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,321 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-09 05:46:39,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:39,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:39,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:39,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:39,325 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 3 states. [2019-09-09 05:46:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,358 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2019-09-09 05:46:39,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:39,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-09 05:46:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,359 INFO L225 Difference]: With dead ends: 119 [2019-09-09 05:46:39,360 INFO L226 Difference]: Without dead ends: 117 [2019-09-09 05:46:39,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-09-09 05:46:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-09-09 05:46:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-09 05:46:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-09-09 05:46:39,366 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 58 [2019-09-09 05:46:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:39,367 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-09-09 05:46:39,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-09-09 05:46:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-09 05:46:39,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:39,368 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:39,368 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:39,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:39,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1535327622, now seen corresponding path program 1 times [2019-09-09 05:46:39,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:39,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:39,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,488 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-09 05:46:39,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:39,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:39,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:39,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:39,490 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 5 states. [2019-09-09 05:46:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,502 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2019-09-09 05:46:39,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:39,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-09 05:46:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,505 INFO L225 Difference]: With dead ends: 102 [2019-09-09 05:46:39,505 INFO L226 Difference]: Without dead ends: 102 [2019-09-09 05:46:39,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-09 05:46:39,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-09-09 05:46:39,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-09 05:46:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2019-09-09 05:46:39,511 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 58 [2019-09-09 05:46:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:39,512 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2019-09-09 05:46:39,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2019-09-09 05:46:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-09 05:46:39,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:39,514 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:39,514 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:39,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:39,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1832020397, now seen corresponding path program 1 times [2019-09-09 05:46:39,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:39,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,620 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-09 05:46:39,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:39,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:39,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:39,622 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 5 states. [2019-09-09 05:46:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,732 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-09-09 05:46:39,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:39,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-09 05:46:39,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,734 INFO L225 Difference]: With dead ends: 96 [2019-09-09 05:46:39,734 INFO L226 Difference]: Without dead ends: 94 [2019-09-09 05:46:39,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-09 05:46:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-09-09 05:46:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-09 05:46:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2019-09-09 05:46:39,743 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 62 [2019-09-09 05:46:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:39,743 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2019-09-09 05:46:39,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2019-09-09 05:46:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:46:39,745 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:39,746 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:39,746 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash 198062706, now seen corresponding path program 1 times [2019-09-09 05:46:39,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:39,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:39,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,809 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-09 05:46:39,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:46:39,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:46:39,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:46:39,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:39,811 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 3 states. [2019-09-09 05:46:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,833 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-09-09 05:46:39,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:46:39,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-09 05:46:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,836 INFO L225 Difference]: With dead ends: 100 [2019-09-09 05:46:39,836 INFO L226 Difference]: Without dead ends: 100 [2019-09-09 05:46:39,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:46:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-09 05:46:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-09-09 05:46:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-09 05:46:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2019-09-09 05:46:39,841 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2019-09-09 05:46:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:39,842 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2019-09-09 05:46:39,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:46:39,842 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2019-09-09 05:46:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:46:39,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:39,850 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:39,851 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:39,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1883613746, now seen corresponding path program 1 times [2019-09-09 05:46:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:39,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:39,942 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-09 05:46:39,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:39,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:39,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:39,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:39,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:39,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:39,944 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 7 states. [2019-09-09 05:46:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:39,995 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-09-09 05:46:39,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:39,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-09-09 05:46:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:39,998 INFO L225 Difference]: With dead ends: 97 [2019-09-09 05:46:39,998 INFO L226 Difference]: Without dead ends: 97 [2019-09-09 05:46:39,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-09 05:46:40,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-09-09 05:46:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-09-09 05:46:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-09-09 05:46:40,004 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 64 [2019-09-09 05:46:40,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:40,004 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-09-09 05:46:40,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-09-09 05:46:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:46:40,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:40,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:40,006 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:40,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:40,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1968245100, now seen corresponding path program 1 times [2019-09-09 05:46:40,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:40,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:40,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:40,139 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-09 05:46:40,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:40,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 05:46:40,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:40,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:46:40,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:46:40,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:40,140 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 7 states. [2019-09-09 05:46:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:40,322 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2019-09-09 05:46:40,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:46:40,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-09-09 05:46:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:40,323 INFO L225 Difference]: With dead ends: 103 [2019-09-09 05:46:40,323 INFO L226 Difference]: Without dead ends: 91 [2019-09-09 05:46:40,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:46:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-09 05:46:40,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2019-09-09 05:46:40,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-09 05:46:40,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2019-09-09 05:46:40,327 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2019-09-09 05:46:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:40,327 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2019-09-09 05:46:40,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:46:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2019-09-09 05:46:40,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:46:40,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:40,329 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:40,329 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:40,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:40,329 INFO L82 PathProgramCache]: Analyzing trace with hash -603130258, now seen corresponding path program 1 times [2019-09-09 05:46:40,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:40,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:40,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:46:40,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:40,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:40,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:40,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:40,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:40,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:40,447 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 5 states. [2019-09-09 05:46:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:40,546 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-09-09 05:46:40,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:40,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-09 05:46:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:40,548 INFO L225 Difference]: With dead ends: 79 [2019-09-09 05:46:40,548 INFO L226 Difference]: Without dead ends: 78 [2019-09-09 05:46:40,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:46:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-09 05:46:40,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-09 05:46:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-09 05:46:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2019-09-09 05:46:40,552 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2019-09-09 05:46:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:40,553 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2019-09-09 05:46:40,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2019-09-09 05:46:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:46:40,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:40,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:40,555 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1151601388, now seen corresponding path program 1 times [2019-09-09 05:46:40,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:40,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:40,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:40,651 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-09 05:46:40,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:40,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:46:40,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:40,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:46:40,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:46:40,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:40,653 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 6 states. [2019-09-09 05:46:40,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:40,681 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-09-09 05:46:40,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:46:40,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-09 05:46:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:40,683 INFO L225 Difference]: With dead ends: 78 [2019-09-09 05:46:40,683 INFO L226 Difference]: Without dead ends: 78 [2019-09-09 05:46:40,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:46:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-09 05:46:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-09-09 05:46:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-09-09 05:46:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-09-09 05:46:40,686 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2019-09-09 05:46:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:40,686 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-09-09 05:46:40,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:46:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-09-09 05:46:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-09 05:46:40,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:46:40,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:46:40,688 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:46:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:46:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash -42695807, now seen corresponding path program 1 times [2019-09-09 05:46:40,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:46:40,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:46:40,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:46:40,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:46:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:46:40,759 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-09 05:46:40,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:46:40,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:46:40,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:46:40,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:46:40,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:46:40,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:46:40,760 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 5 states. [2019-09-09 05:46:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:46:40,846 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-09-09 05:46:40,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:46:40,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-09 05:46:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:46:40,847 INFO L225 Difference]: With dead ends: 60 [2019-09-09 05:46:40,847 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:46:40,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:46:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:46:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:46:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:46:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:46:40,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2019-09-09 05:46:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:46:40,849 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:46:40,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:46:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:46:40,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:46:40,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:46:40 BoogieIcfgContainer [2019-09-09 05:46:40,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:46:40,858 INFO L168 Benchmark]: Toolchain (without parser) took 5599.46 ms. Allocated memory was 133.2 MB in the beginning and 319.8 MB in the end (delta: 186.6 MB). Free memory was 89.1 MB in the beginning and 264.1 MB in the end (delta: -175.0 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:46:40,859 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:46:40,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.40 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 88.9 MB in the beginning and 169.9 MB in the end (delta: -81.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:46:40,861 INFO L168 Benchmark]: Boogie Preprocessor took 101.92 ms. Allocated memory is still 199.8 MB. Free memory was 169.9 MB in the beginning and 166.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:46:40,862 INFO L168 Benchmark]: RCFGBuilder took 992.05 ms. Allocated memory is still 199.8 MB. Free memory was 166.7 MB in the beginning and 97.9 MB in the end (delta: 68.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:46:40,863 INFO L168 Benchmark]: TraceAbstraction took 3873.34 ms. Allocated memory was 199.8 MB in the beginning and 319.8 MB in the end (delta: 120.1 MB). Free memory was 97.9 MB in the beginning and 264.1 MB in the end (delta: -166.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 05:46:40,866 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.22 ms. Allocated memory is still 133.2 MB. Free memory was 107.7 MB in the beginning and 107.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 627.40 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 88.9 MB in the beginning and 169.9 MB in the end (delta: -81.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.92 ms. Allocated memory is still 199.8 MB. Free memory was 169.9 MB in the beginning and 166.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 992.05 ms. Allocated memory is still 199.8 MB. Free memory was 166.7 MB in the beginning and 97.9 MB in the end (delta: 68.7 MB). Peak memory consumption was 68.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3873.34 ms. Allocated memory was 199.8 MB in the beginning and 319.8 MB in the end (delta: 120.1 MB). Free memory was 97.9 MB in the beginning and 264.1 MB in the end (delta: -166.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 239 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2945 SDtfs, 1579 SDslu, 3223 SDs, 0 SdLazy, 582 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred 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.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 82 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 87896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...