java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:05:09,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:05:09,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:05:09,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:05:09,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:05:09,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:05:09,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:05:09,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:05:09,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:05:09,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:05:09,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:05:09,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:05:09,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:05:09,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:05:09,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:05:09,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:05:09,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:05:09,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:05:09,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:05:09,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:05:09,959 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:05:09,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:05:09,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:05:09,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:05:09,964 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:05:09,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:05:09,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:05:09,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:05:09,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:05:09,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:05:09,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:05:09,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:05:09,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:05:09,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:05:09,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:05:09,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:05:09,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:05:09,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:05:09,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:05:09,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:05:09,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:05:09,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:05:09,989 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:05:09,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:05:09,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:05:09,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:05:09,991 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:05:09,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:05:09,992 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:05:09,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:05:09,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:05:09,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:05:09,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:05:09,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:05:09,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:05:09,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:05:09,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:05:09,993 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:05:09,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:05:09,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:05:09,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:05:09,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:05:09,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:05:09,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:05:09,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:05:09,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:05:09,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:05:09,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:05:09,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:05:09,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:05:09,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:05:10,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:05:10,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:05:10,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:05:10,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:05:10,323 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:05:10,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-10-15 03:05:10,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2ea6929/9ce02a89716748aebe5c5bccab13a190/FLAGab37c00ea [2019-10-15 03:05:11,016 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:05:11,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-10-15 03:05:11,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2ea6929/9ce02a89716748aebe5c5bccab13a190/FLAGab37c00ea [2019-10-15 03:05:11,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2ea6929/9ce02a89716748aebe5c5bccab13a190 [2019-10-15 03:05:11,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:05:11,256 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:05:11,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:11,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:05:11,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:05:11,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:11" (1/1) ... [2019-10-15 03:05:11,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9aa9a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:11, skipping insertion in model container [2019-10-15 03:05:11,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:11" (1/1) ... [2019-10-15 03:05:11,277 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:05:11,328 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:05:11,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:11,715 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:05:11,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:12,005 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:05:12,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12 WrapperNode [2019-10-15 03:05:12,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:12,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:05:12,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:05:12,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:05:12,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12" (1/1) ... [2019-10-15 03:05:12,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12" (1/1) ... [2019-10-15 03:05:12,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12" (1/1) ... [2019-10-15 03:05:12,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12" (1/1) ... [2019-10-15 03:05:12,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12" (1/1) ... [2019-10-15 03:05:12,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12" (1/1) ... [2019-10-15 03:05:12,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12" (1/1) ... [2019-10-15 03:05:12,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:05:12,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:05:12,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:05:12,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:05:12,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:05:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:05:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:05:12,208 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 03:05:12,208 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 03:05:12,208 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-10-15 03:05:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-10-15 03:05:12,210 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-10-15 03:05:12,211 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-10-15 03:05:12,211 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-10-15 03:05:12,211 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-10-15 03:05:12,212 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-10-15 03:05:12,213 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-10-15 03:05:12,213 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-10-15 03:05:12,213 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-10-15 03:05:12,214 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-10-15 03:05:12,214 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-10-15 03:05:12,216 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-10-15 03:05:12,216 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-10-15 03:05:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 03:05:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:05:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-15 03:05:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 03:05:12,217 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 03:05:12,218 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 03:05:12,218 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 03:05:12,218 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 03:05:12,218 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-15 03:05:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:05:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:05:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:05:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:05:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:05:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-10-15 03:05:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-10-15 03:05:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-10-15 03:05:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-10-15 03:05:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-10-15 03:05:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-10-15 03:05:12,230 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-10-15 03:05:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-10-15 03:05:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-10-15 03:05:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-10-15 03:05:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-10-15 03:05:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-10-15 03:05:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-15 03:05:12,232 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 03:05:12,232 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 03:05:12,232 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 03:05:12,232 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-15 03:05:12,232 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 03:05:12,232 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 03:05:12,232 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 03:05:12,233 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-10-15 03:05:12,233 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-10-15 03:05:12,234 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 03:05:12,234 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:05:12,234 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 03:05:12,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:05:12,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:05:12,736 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:13,113 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-15 03:05:13,113 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-15 03:05:13,124 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:13,221 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-15 03:05:13,222 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-15 03:05:13,244 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:13,270 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 03:05:13,271 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 03:05:13,287 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:13,308 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:13,308 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:13,661 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:13,774 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-15 03:05:13,775 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-15 03:05:13,815 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:13,859 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-15 03:05:13,860 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-15 03:05:14,242 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:05:14,242 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:05:14,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:14 BoogieIcfgContainer [2019-10-15 03:05:14,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:05:14,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:05:14,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:05:14,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:05:14,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:05:11" (1/3) ... [2019-10-15 03:05:14,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112e9234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:14, skipping insertion in model container [2019-10-15 03:05:14,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12" (2/3) ... [2019-10-15 03:05:14,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112e9234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:14, skipping insertion in model container [2019-10-15 03:05:14,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:14" (3/3) ... [2019-10-15 03:05:14,257 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-10-15 03:05:14,268 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:05:14,281 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:05:14,294 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:05:14,349 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:05:14,349 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:05:14,349 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:05:14,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:05:14,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:05:14,350 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:05:14,350 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:05:14,351 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:05:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states. [2019-10-15 03:05:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:05:14,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:14,397 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:14,398 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:14,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1191172788, now seen corresponding path program 1 times [2019-10-15 03:05:14,417 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:14,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242517663] [2019-10-15 03:05:14,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:14,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:14,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:14,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242517663] [2019-10-15 03:05:14,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:14,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:14,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217394973] [2019-10-15 03:05:14,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:14,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:14,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:14,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:14,760 INFO L87 Difference]: Start difference. First operand 251 states. Second operand 3 states. [2019-10-15 03:05:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:14,970 INFO L93 Difference]: Finished difference Result 455 states and 668 transitions. [2019-10-15 03:05:14,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:14,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 03:05:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:14,995 INFO L225 Difference]: With dead ends: 455 [2019-10-15 03:05:14,996 INFO L226 Difference]: Without dead ends: 245 [2019-10-15 03:05:15,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-15 03:05:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-10-15 03:05:15,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-15 03:05:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 326 transitions. [2019-10-15 03:05:15,086 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 326 transitions. Word has length 18 [2019-10-15 03:05:15,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:15,086 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 326 transitions. [2019-10-15 03:05:15,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:15,087 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 326 transitions. [2019-10-15 03:05:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:05:15,089 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:15,089 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:15,092 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1675982491, now seen corresponding path program 1 times [2019-10-15 03:05:15,095 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:15,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370546170] [2019-10-15 03:05:15,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:15,096 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:15,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:15,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370546170] [2019-10-15 03:05:15,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:15,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:15,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232522862] [2019-10-15 03:05:15,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:15,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:15,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:15,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:15,333 INFO L87 Difference]: Start difference. First operand 245 states and 326 transitions. Second operand 3 states. [2019-10-15 03:05:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:15,609 INFO L93 Difference]: Finished difference Result 476 states and 652 transitions. [2019-10-15 03:05:15,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:15,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 03:05:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:15,621 INFO L225 Difference]: With dead ends: 476 [2019-10-15 03:05:15,622 INFO L226 Difference]: Without dead ends: 322 [2019-10-15 03:05:15,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-15 03:05:15,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2019-10-15 03:05:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-15 03:05:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 431 transitions. [2019-10-15 03:05:15,684 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 431 transitions. Word has length 21 [2019-10-15 03:05:15,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:15,685 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 431 transitions. [2019-10-15 03:05:15,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 431 transitions. [2019-10-15 03:05:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 03:05:15,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:15,688 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:15,688 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:15,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:15,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2009387554, now seen corresponding path program 1 times [2019-10-15 03:05:15,689 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:15,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666754712] [2019-10-15 03:05:15,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:15,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:15,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:15,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666754712] [2019-10-15 03:05:15,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:15,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:15,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577945940] [2019-10-15 03:05:15,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:15,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:15,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:15,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:15,792 INFO L87 Difference]: Start difference. First operand 319 states and 431 transitions. Second operand 3 states. [2019-10-15 03:05:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:15,881 INFO L93 Difference]: Finished difference Result 697 states and 983 transitions. [2019-10-15 03:05:15,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:15,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-15 03:05:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:15,890 INFO L225 Difference]: With dead ends: 697 [2019-10-15 03:05:15,891 INFO L226 Difference]: Without dead ends: 482 [2019-10-15 03:05:15,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-15 03:05:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 445. [2019-10-15 03:05:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-10-15 03:05:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 625 transitions. [2019-10-15 03:05:15,973 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 625 transitions. Word has length 27 [2019-10-15 03:05:15,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:15,973 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 625 transitions. [2019-10-15 03:05:15,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 625 transitions. [2019-10-15 03:05:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-15 03:05:15,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:15,982 INFO L380 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] [2019-10-15 03:05:15,982 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:15,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:15,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1753868575, now seen corresponding path program 1 times [2019-10-15 03:05:15,983 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:15,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201558981] [2019-10-15 03:05:15,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:15,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:15,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:16,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201558981] [2019-10-15 03:05:16,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:16,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:16,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555555062] [2019-10-15 03:05:16,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:16,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:16,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,107 INFO L87 Difference]: Start difference. First operand 445 states and 625 transitions. Second operand 3 states. [2019-10-15 03:05:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:16,214 INFO L93 Difference]: Finished difference Result 454 states and 636 transitions. [2019-10-15 03:05:16,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:16,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-15 03:05:16,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:16,220 INFO L225 Difference]: With dead ends: 454 [2019-10-15 03:05:16,220 INFO L226 Difference]: Without dead ends: 450 [2019-10-15 03:05:16,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-15 03:05:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2019-10-15 03:05:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-15 03:05:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 631 transitions. [2019-10-15 03:05:16,263 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 631 transitions. Word has length 30 [2019-10-15 03:05:16,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:16,263 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 631 transitions. [2019-10-15 03:05:16,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:16,264 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 631 transitions. [2019-10-15 03:05:16,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 03:05:16,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:16,266 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:16,267 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:16,271 INFO L82 PathProgramCache]: Analyzing trace with hash -641221973, now seen corresponding path program 1 times [2019-10-15 03:05:16,271 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:16,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395542458] [2019-10-15 03:05:16,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:16,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395542458] [2019-10-15 03:05:16,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:16,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:16,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116282985] [2019-10-15 03:05:16,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:16,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:16,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:16,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,346 INFO L87 Difference]: Start difference. First operand 450 states and 631 transitions. Second operand 3 states. [2019-10-15 03:05:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:16,425 INFO L93 Difference]: Finished difference Result 784 states and 1130 transitions. [2019-10-15 03:05:16,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:16,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-15 03:05:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:16,434 INFO L225 Difference]: With dead ends: 784 [2019-10-15 03:05:16,434 INFO L226 Difference]: Without dead ends: 765 [2019-10-15 03:05:16,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-10-15 03:05:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 755. [2019-10-15 03:05:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-10-15 03:05:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1092 transitions. [2019-10-15 03:05:16,489 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1092 transitions. Word has length 34 [2019-10-15 03:05:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:16,490 INFO L462 AbstractCegarLoop]: Abstraction has 755 states and 1092 transitions. [2019-10-15 03:05:16,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1092 transitions. [2019-10-15 03:05:16,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 03:05:16,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:16,494 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:16,494 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:16,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:16,495 INFO L82 PathProgramCache]: Analyzing trace with hash -655566882, now seen corresponding path program 1 times [2019-10-15 03:05:16,495 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:16,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191827653] [2019-10-15 03:05:16,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,496 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:16,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191827653] [2019-10-15 03:05:16,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:16,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:16,559 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725048894] [2019-10-15 03:05:16,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:16,560 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:16,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:16,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,561 INFO L87 Difference]: Start difference. First operand 755 states and 1092 transitions. Second operand 3 states. [2019-10-15 03:05:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:16,700 INFO L93 Difference]: Finished difference Result 781 states and 1121 transitions. [2019-10-15 03:05:16,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:16,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-15 03:05:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:16,708 INFO L225 Difference]: With dead ends: 781 [2019-10-15 03:05:16,708 INFO L226 Difference]: Without dead ends: 776 [2019-10-15 03:05:16,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-10-15 03:05:16,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 774. [2019-10-15 03:05:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-10-15 03:05:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1113 transitions. [2019-10-15 03:05:16,758 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1113 transitions. Word has length 34 [2019-10-15 03:05:16,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:16,759 INFO L462 AbstractCegarLoop]: Abstraction has 774 states and 1113 transitions. [2019-10-15 03:05:16,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1113 transitions. [2019-10-15 03:05:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 03:05:16,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:16,761 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:16,761 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:16,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:16,761 INFO L82 PathProgramCache]: Analyzing trace with hash 409313685, now seen corresponding path program 1 times [2019-10-15 03:05:16,762 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:16,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217220247] [2019-10-15 03:05:16,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:16,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217220247] [2019-10-15 03:05:16,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:16,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:16,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512706681] [2019-10-15 03:05:16,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:16,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:16,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:16,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,835 INFO L87 Difference]: Start difference. First operand 774 states and 1113 transitions. Second operand 3 states. [2019-10-15 03:05:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:16,913 INFO L93 Difference]: Finished difference Result 1072 states and 1575 transitions. [2019-10-15 03:05:16,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:16,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-15 03:05:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:16,919 INFO L225 Difference]: With dead ends: 1072 [2019-10-15 03:05:16,919 INFO L226 Difference]: Without dead ends: 446 [2019-10-15 03:05:16,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-15 03:05:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-10-15 03:05:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-15 03:05:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 619 transitions. [2019-10-15 03:05:16,958 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 619 transitions. Word has length 37 [2019-10-15 03:05:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:16,961 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 619 transitions. [2019-10-15 03:05:16,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 619 transitions. [2019-10-15 03:05:16,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 03:05:16,962 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:16,962 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:16,963 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:16,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1604989566, now seen corresponding path program 1 times [2019-10-15 03:05:16,964 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:16,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55820625] [2019-10-15 03:05:16,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:17,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55820625] [2019-10-15 03:05:17,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:17,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:17,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197255321] [2019-10-15 03:05:17,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:17,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:17,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:17,054 INFO L87 Difference]: Start difference. First operand 446 states and 619 transitions. Second operand 5 states. [2019-10-15 03:05:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:17,129 INFO L93 Difference]: Finished difference Result 461 states and 637 transitions. [2019-10-15 03:05:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:17,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-10-15 03:05:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:17,137 INFO L225 Difference]: With dead ends: 461 [2019-10-15 03:05:17,137 INFO L226 Difference]: Without dead ends: 440 [2019-10-15 03:05:17,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-10-15 03:05:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2019-10-15 03:05:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-15 03:05:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 611 transitions. [2019-10-15 03:05:17,166 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 611 transitions. Word has length 35 [2019-10-15 03:05:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:17,166 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 611 transitions. [2019-10-15 03:05:17,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 611 transitions. [2019-10-15 03:05:17,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-15 03:05:17,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:17,169 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:17,169 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:17,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:17,169 INFO L82 PathProgramCache]: Analyzing trace with hash -367438247, now seen corresponding path program 1 times [2019-10-15 03:05:17,170 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:17,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835211286] [2019-10-15 03:05:17,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:17,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835211286] [2019-10-15 03:05:17,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:17,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:17,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245874770] [2019-10-15 03:05:17,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:17,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:17,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:17,246 INFO L87 Difference]: Start difference. First operand 440 states and 611 transitions. Second operand 3 states. [2019-10-15 03:05:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:17,422 INFO L93 Difference]: Finished difference Result 636 states and 933 transitions. [2019-10-15 03:05:17,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:17,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-15 03:05:17,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:17,427 INFO L225 Difference]: With dead ends: 636 [2019-10-15 03:05:17,427 INFO L226 Difference]: Without dead ends: 628 [2019-10-15 03:05:17,428 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-15 03:05:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 496. [2019-10-15 03:05:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-15 03:05:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 699 transitions. [2019-10-15 03:05:17,466 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 699 transitions. Word has length 39 [2019-10-15 03:05:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:17,466 INFO L462 AbstractCegarLoop]: Abstraction has 496 states and 699 transitions. [2019-10-15 03:05:17,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:17,466 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 699 transitions. [2019-10-15 03:05:17,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:17,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:17,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:17,468 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:17,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1695097799, now seen corresponding path program 1 times [2019-10-15 03:05:17,469 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:17,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485312481] [2019-10-15 03:05:17,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:17,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485312481] [2019-10-15 03:05:17,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:17,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:05:17,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416686975] [2019-10-15 03:05:17,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:05:17,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:17,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:05:17,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:05:17,529 INFO L87 Difference]: Start difference. First operand 496 states and 699 transitions. Second operand 4 states. [2019-10-15 03:05:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:17,801 INFO L93 Difference]: Finished difference Result 555 states and 759 transitions. [2019-10-15 03:05:17,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:05:17,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-15 03:05:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:17,804 INFO L225 Difference]: With dead ends: 555 [2019-10-15 03:05:17,804 INFO L226 Difference]: Without dead ends: 354 [2019-10-15 03:05:17,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:05:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-15 03:05:17,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 337. [2019-10-15 03:05:17,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-15 03:05:17,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 430 transitions. [2019-10-15 03:05:17,825 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 430 transitions. Word has length 43 [2019-10-15 03:05:17,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:17,825 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 430 transitions. [2019-10-15 03:05:17,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:05:17,825 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 430 transitions. [2019-10-15 03:05:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:05:17,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:17,827 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:17,827 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:17,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1729441489, now seen corresponding path program 1 times [2019-10-15 03:05:17,827 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:17,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649251838] [2019-10-15 03:05:17,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:17,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649251838] [2019-10-15 03:05:17,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:17,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:17,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915250058] [2019-10-15 03:05:17,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:17,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:17,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:17,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:17,933 INFO L87 Difference]: Start difference. First operand 337 states and 430 transitions. Second operand 10 states. [2019-10-15 03:05:19,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:19,201 INFO L93 Difference]: Finished difference Result 366 states and 462 transitions. [2019-10-15 03:05:19,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:19,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-10-15 03:05:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:19,205 INFO L225 Difference]: With dead ends: 366 [2019-10-15 03:05:19,205 INFO L226 Difference]: Without dead ends: 360 [2019-10-15 03:05:19,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:05:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-10-15 03:05:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 337. [2019-10-15 03:05:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-15 03:05:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 429 transitions. [2019-10-15 03:05:19,232 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 429 transitions. Word has length 40 [2019-10-15 03:05:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:19,232 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 429 transitions. [2019-10-15 03:05:19,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:19,233 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 429 transitions. [2019-10-15 03:05:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:05:19,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:19,234 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:19,234 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1947319489, now seen corresponding path program 1 times [2019-10-15 03:05:19,235 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:19,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859845161] [2019-10-15 03:05:19,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:19,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:19,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:19,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859845161] [2019-10-15 03:05:19,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:19,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:19,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296984142] [2019-10-15 03:05:19,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:19,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:19,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:19,333 INFO L87 Difference]: Start difference. First operand 337 states and 429 transitions. Second operand 5 states. [2019-10-15 03:05:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:19,900 INFO L93 Difference]: Finished difference Result 451 states and 605 transitions. [2019-10-15 03:05:19,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:19,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-15 03:05:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:19,905 INFO L225 Difference]: With dead ends: 451 [2019-10-15 03:05:19,905 INFO L226 Difference]: Without dead ends: 443 [2019-10-15 03:05:19,906 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-15 03:05:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 337. [2019-10-15 03:05:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-15 03:05:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 428 transitions. [2019-10-15 03:05:19,929 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 428 transitions. Word has length 40 [2019-10-15 03:05:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:19,929 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 428 transitions. [2019-10-15 03:05:19,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 428 transitions. [2019-10-15 03:05:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:05:19,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:19,931 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:19,931 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:19,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:19,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1332761529, now seen corresponding path program 1 times [2019-10-15 03:05:19,931 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:19,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307481551] [2019-10-15 03:05:19,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:19,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:19,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:20,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307481551] [2019-10-15 03:05:20,048 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:20,048 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:20,048 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462179388] [2019-10-15 03:05:20,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:20,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:20,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:20,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:20,050 INFO L87 Difference]: Start difference. First operand 337 states and 428 transitions. Second operand 10 states. [2019-10-15 03:05:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:20,989 INFO L93 Difference]: Finished difference Result 366 states and 459 transitions. [2019-10-15 03:05:20,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:20,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-10-15 03:05:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:20,992 INFO L225 Difference]: With dead ends: 366 [2019-10-15 03:05:20,992 INFO L226 Difference]: Without dead ends: 360 [2019-10-15 03:05:20,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:05:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-10-15 03:05:21,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 337. [2019-10-15 03:05:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-15 03:05:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 427 transitions. [2019-10-15 03:05:21,023 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 427 transitions. Word has length 41 [2019-10-15 03:05:21,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,023 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 427 transitions. [2019-10-15 03:05:21,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:21,024 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 427 transitions. [2019-10-15 03:05:21,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:05:21,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,026 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:21,027 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,027 INFO L82 PathProgramCache]: Analyzing trace with hash -660070045, now seen corresponding path program 1 times [2019-10-15 03:05:21,028 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269635693] [2019-10-15 03:05:21,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:21,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269635693] [2019-10-15 03:05:21,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:21,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001710785] [2019-10-15 03:05:21,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:21,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:21,188 INFO L87 Difference]: Start difference. First operand 337 states and 427 transitions. Second operand 8 states. [2019-10-15 03:05:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,445 INFO L93 Difference]: Finished difference Result 353 states and 445 transitions. [2019-10-15 03:05:21,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:21,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-10-15 03:05:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,449 INFO L225 Difference]: With dead ends: 353 [2019-10-15 03:05:21,449 INFO L226 Difference]: Without dead ends: 349 [2019-10-15 03:05:21,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-15 03:05:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2019-10-15 03:05:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-10-15 03:05:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 437 transitions. [2019-10-15 03:05:21,478 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 437 transitions. Word has length 41 [2019-10-15 03:05:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,480 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 437 transitions. [2019-10-15 03:05:21,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 437 transitions. [2019-10-15 03:05:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:05:21,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,482 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:21,482 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash -660346875, now seen corresponding path program 1 times [2019-10-15 03:05:21,483 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350371324] [2019-10-15 03:05:21,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:21,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350371324] [2019-10-15 03:05:21,561 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:21,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841875700] [2019-10-15 03:05:21,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:21,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:21,563 INFO L87 Difference]: Start difference. First operand 345 states and 437 transitions. Second operand 5 states. [2019-10-15 03:05:22,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:22,202 INFO L93 Difference]: Finished difference Result 453 states and 606 transitions. [2019-10-15 03:05:22,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:22,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-10-15 03:05:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:22,208 INFO L225 Difference]: With dead ends: 453 [2019-10-15 03:05:22,208 INFO L226 Difference]: Without dead ends: 434 [2019-10-15 03:05:22,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-10-15 03:05:22,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 334. [2019-10-15 03:05:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-15 03:05:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 422 transitions. [2019-10-15 03:05:22,243 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 422 transitions. Word has length 41 [2019-10-15 03:05:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:22,243 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 422 transitions. [2019-10-15 03:05:22,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 422 transitions. [2019-10-15 03:05:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:22,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:22,245 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:22,245 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1579025384, now seen corresponding path program 1 times [2019-10-15 03:05:22,246 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:22,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619526838] [2019-10-15 03:05:22,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:22,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619526838] [2019-10-15 03:05:22,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:22,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:05:22,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433355490] [2019-10-15 03:05:22,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:05:22,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:22,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:05:22,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:22,358 INFO L87 Difference]: Start difference. First operand 334 states and 422 transitions. Second operand 6 states. [2019-10-15 03:05:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:22,429 INFO L93 Difference]: Finished difference Result 357 states and 447 transitions. [2019-10-15 03:05:22,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:22,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-10-15 03:05:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:22,432 INFO L225 Difference]: With dead ends: 357 [2019-10-15 03:05:22,433 INFO L226 Difference]: Without dead ends: 332 [2019-10-15 03:05:22,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-15 03:05:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-10-15 03:05:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-10-15 03:05:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 417 transitions. [2019-10-15 03:05:22,457 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 417 transitions. Word has length 42 [2019-10-15 03:05:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:22,458 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 417 transitions. [2019-10-15 03:05:22,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:05:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 417 transitions. [2019-10-15 03:05:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:22,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:22,459 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:22,459 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:22,460 INFO L82 PathProgramCache]: Analyzing trace with hash -488362368, now seen corresponding path program 1 times [2019-10-15 03:05:22,460 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:22,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651432805] [2019-10-15 03:05:22,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:22,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651432805] [2019-10-15 03:05:22,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:22,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:22,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781032490] [2019-10-15 03:05:22,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:22,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:22,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:22,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:22,581 INFO L87 Difference]: Start difference. First operand 332 states and 417 transitions. Second operand 7 states. [2019-10-15 03:05:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:23,610 INFO L93 Difference]: Finished difference Result 448 states and 590 transitions. [2019-10-15 03:05:23,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 03:05:23,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-10-15 03:05:23,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:23,613 INFO L225 Difference]: With dead ends: 448 [2019-10-15 03:05:23,613 INFO L226 Difference]: Without dead ends: 411 [2019-10-15 03:05:23,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-15 03:05:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2019-10-15 03:05:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-10-15 03:05:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 542 transitions. [2019-10-15 03:05:23,650 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 542 transitions. Word has length 42 [2019-10-15 03:05:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:23,651 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 542 transitions. [2019-10-15 03:05:23,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 542 transitions. [2019-10-15 03:05:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:05:23,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:23,652 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:23,652 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1359230801, now seen corresponding path program 1 times [2019-10-15 03:05:23,653 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:23,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725679099] [2019-10-15 03:05:23,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:23,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725679099] [2019-10-15 03:05:23,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:23,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:23,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508338727] [2019-10-15 03:05:23,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:23,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:23,774 INFO L87 Difference]: Start difference. First operand 407 states and 542 transitions. Second operand 8 states. [2019-10-15 03:05:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:23,975 INFO L93 Difference]: Finished difference Result 421 states and 557 transitions. [2019-10-15 03:05:23,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:23,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-10-15 03:05:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:23,978 INFO L225 Difference]: With dead ends: 421 [2019-10-15 03:05:23,979 INFO L226 Difference]: Without dead ends: 396 [2019-10-15 03:05:23,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:23,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-10-15 03:05:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2019-10-15 03:05:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-15 03:05:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 529 transitions. [2019-10-15 03:05:24,010 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 529 transitions. Word has length 42 [2019-10-15 03:05:24,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:24,010 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 529 transitions. [2019-10-15 03:05:24,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 529 transitions. [2019-10-15 03:05:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:24,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:24,011 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:24,012 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1419195772, now seen corresponding path program 1 times [2019-10-15 03:05:24,012 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:24,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933295453] [2019-10-15 03:05:24,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,013 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:24,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933295453] [2019-10-15 03:05:24,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:24,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:24,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074463525] [2019-10-15 03:05:24,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:24,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:24,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:24,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:24,142 INFO L87 Difference]: Start difference. First operand 396 states and 529 transitions. Second operand 9 states. [2019-10-15 03:05:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:26,302 INFO L93 Difference]: Finished difference Result 493 states and 684 transitions. [2019-10-15 03:05:26,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-15 03:05:26,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-10-15 03:05:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:26,305 INFO L225 Difference]: With dead ends: 493 [2019-10-15 03:05:26,306 INFO L226 Difference]: Without dead ends: 464 [2019-10-15 03:05:26,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:05:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-15 03:05:26,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 374. [2019-10-15 03:05:26,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-15 03:05:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 505 transitions. [2019-10-15 03:05:26,340 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 505 transitions. Word has length 43 [2019-10-15 03:05:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:26,340 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 505 transitions. [2019-10-15 03:05:26,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 505 transitions. [2019-10-15 03:05:26,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:26,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:26,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:26,342 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:26,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:26,342 INFO L82 PathProgramCache]: Analyzing trace with hash 693673709, now seen corresponding path program 1 times [2019-10-15 03:05:26,342 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:26,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617016106] [2019-10-15 03:05:26,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,343 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:26,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617016106] [2019-10-15 03:05:26,383 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:26,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:26,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913984994] [2019-10-15 03:05:26,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:26,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:26,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:26,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:26,385 INFO L87 Difference]: Start difference. First operand 374 states and 505 transitions. Second operand 3 states. [2019-10-15 03:05:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:26,521 INFO L93 Difference]: Finished difference Result 524 states and 775 transitions. [2019-10-15 03:05:26,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:26,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 03:05:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:26,526 INFO L225 Difference]: With dead ends: 524 [2019-10-15 03:05:26,526 INFO L226 Difference]: Without dead ends: 511 [2019-10-15 03:05:26,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-15 03:05:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 369. [2019-10-15 03:05:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-10-15 03:05:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 497 transitions. [2019-10-15 03:05:26,560 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 497 transitions. Word has length 43 [2019-10-15 03:05:26,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:26,561 INFO L462 AbstractCegarLoop]: Abstraction has 369 states and 497 transitions. [2019-10-15 03:05:26,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 497 transitions. [2019-10-15 03:05:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:05:26,562 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:26,562 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:26,562 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:26,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:26,562 INFO L82 PathProgramCache]: Analyzing trace with hash 482051757, now seen corresponding path program 1 times [2019-10-15 03:05:26,563 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:26,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439305919] [2019-10-15 03:05:26,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,563 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:26,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:26,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439305919] [2019-10-15 03:05:26,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:26,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:26,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696412610] [2019-10-15 03:05:26,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:26,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:26,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:26,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:26,736 INFO L87 Difference]: Start difference. First operand 369 states and 497 transitions. Second operand 8 states. [2019-10-15 03:05:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:26,990 INFO L93 Difference]: Finished difference Result 384 states and 514 transitions. [2019-10-15 03:05:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:26,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-15 03:05:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:26,998 INFO L225 Difference]: With dead ends: 384 [2019-10-15 03:05:26,999 INFO L226 Difference]: Without dead ends: 380 [2019-10-15 03:05:27,002 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-15 03:05:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2019-10-15 03:05:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-10-15 03:05:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 506 transitions. [2019-10-15 03:05:27,030 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 506 transitions. Word has length 44 [2019-10-15 03:05:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:27,030 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 506 transitions. [2019-10-15 03:05:27,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 506 transitions. [2019-10-15 03:05:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:05:27,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,032 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:27,033 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash 481774927, now seen corresponding path program 1 times [2019-10-15 03:05:27,033 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934821962] [2019-10-15 03:05:27,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:27,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934821962] [2019-10-15 03:05:27,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:27,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:27,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422156316] [2019-10-15 03:05:27,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:27,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:27,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:27,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:27,103 INFO L87 Difference]: Start difference. First operand 376 states and 506 transitions. Second operand 5 states. [2019-10-15 03:05:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:27,653 INFO L93 Difference]: Finished difference Result 522 states and 772 transitions. [2019-10-15 03:05:27,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:27,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-15 03:05:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:27,657 INFO L225 Difference]: With dead ends: 522 [2019-10-15 03:05:27,657 INFO L226 Difference]: Without dead ends: 492 [2019-10-15 03:05:27,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-15 03:05:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 352. [2019-10-15 03:05:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-15 03:05:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 478 transitions. [2019-10-15 03:05:27,685 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 478 transitions. Word has length 44 [2019-10-15 03:05:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:27,685 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 478 transitions. [2019-10-15 03:05:27,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 478 transitions. [2019-10-15 03:05:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:27,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:27,686 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash -590774519, now seen corresponding path program 1 times [2019-10-15 03:05:27,687 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181106268] [2019-10-15 03:05:27,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,687 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:27,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181106268] [2019-10-15 03:05:27,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:27,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:27,734 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991322205] [2019-10-15 03:05:27,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:27,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:27,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:27,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:27,735 INFO L87 Difference]: Start difference. First operand 352 states and 478 transitions. Second operand 3 states. [2019-10-15 03:05:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:27,845 INFO L93 Difference]: Finished difference Result 622 states and 888 transitions. [2019-10-15 03:05:27,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:27,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-15 03:05:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:27,853 INFO L225 Difference]: With dead ends: 622 [2019-10-15 03:05:27,853 INFO L226 Difference]: Without dead ends: 351 [2019-10-15 03:05:27,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-15 03:05:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2019-10-15 03:05:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-10-15 03:05:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 475 transitions. [2019-10-15 03:05:27,884 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 475 transitions. Word has length 50 [2019-10-15 03:05:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:27,885 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 475 transitions. [2019-10-15 03:05:27,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2019-10-15 03:05:27,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 03:05:27,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,888 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:27,889 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1094301255, now seen corresponding path program 1 times [2019-10-15 03:05:27,890 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527588766] [2019-10-15 03:05:27,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,890 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:28,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527588766] [2019-10-15 03:05:28,002 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:05:28,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479246750] [2019-10-15 03:05:28,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:05:28,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:05:28,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:28,004 INFO L87 Difference]: Start difference. First operand 351 states and 475 transitions. Second operand 6 states. [2019-10-15 03:05:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,105 INFO L93 Difference]: Finished difference Result 366 states and 491 transitions. [2019-10-15 03:05:28,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:28,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-15 03:05:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,108 INFO L225 Difference]: With dead ends: 366 [2019-10-15 03:05:28,108 INFO L226 Difference]: Without dead ends: 333 [2019-10-15 03:05:28,110 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-10-15 03:05:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-10-15 03:05:28,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-10-15 03:05:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 455 transitions. [2019-10-15 03:05:28,140 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 455 transitions. Word has length 46 [2019-10-15 03:05:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,141 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 455 transitions. [2019-10-15 03:05:28,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:05:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 455 transitions. [2019-10-15 03:05:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:28,142 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:28,142 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1328869361, now seen corresponding path program 1 times [2019-10-15 03:05:28,143 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103635672] [2019-10-15 03:05:28,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:28,192 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103635672] [2019-10-15 03:05:28,192 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:28,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531377950] [2019-10-15 03:05:28,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:28,194 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:28,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:28,195 INFO L87 Difference]: Start difference. First operand 333 states and 455 transitions. Second operand 3 states. [2019-10-15 03:05:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,302 INFO L93 Difference]: Finished difference Result 430 states and 610 transitions. [2019-10-15 03:05:28,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:28,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-15 03:05:28,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,306 INFO L225 Difference]: With dead ends: 430 [2019-10-15 03:05:28,306 INFO L226 Difference]: Without dead ends: 427 [2019-10-15 03:05:28,307 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-15 03:05:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 335. [2019-10-15 03:05:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-10-15 03:05:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 458 transitions. [2019-10-15 03:05:28,333 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 458 transitions. Word has length 54 [2019-10-15 03:05:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,334 INFO L462 AbstractCegarLoop]: Abstraction has 335 states and 458 transitions. [2019-10-15 03:05:28,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 458 transitions. [2019-10-15 03:05:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:28,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,335 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:28,335 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash 529879, now seen corresponding path program 1 times [2019-10-15 03:05:28,336 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330698525] [2019-10-15 03:05:28,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:28,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330698525] [2019-10-15 03:05:28,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:28,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808214097] [2019-10-15 03:05:28,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:28,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:28,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:28,461 INFO L87 Difference]: Start difference. First operand 335 states and 458 transitions. Second operand 5 states. [2019-10-15 03:05:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,531 INFO L93 Difference]: Finished difference Result 822 states and 1255 transitions. [2019-10-15 03:05:29,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:29,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-15 03:05:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,540 INFO L225 Difference]: With dead ends: 822 [2019-10-15 03:05:29,540 INFO L226 Difference]: Without dead ends: 553 [2019-10-15 03:05:29,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-15 03:05:29,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 399. [2019-10-15 03:05:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-10-15 03:05:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 578 transitions. [2019-10-15 03:05:29,584 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 578 transitions. Word has length 54 [2019-10-15 03:05:29,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,584 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 578 transitions. [2019-10-15 03:05:29,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:29,584 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 578 transitions. [2019-10-15 03:05:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:05:29,585 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,585 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:29,585 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1194403120, now seen corresponding path program 1 times [2019-10-15 03:05:29,586 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142105955] [2019-10-15 03:05:29,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:29,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:29,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142105955] [2019-10-15 03:05:29,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:29,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:05:29,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708443570] [2019-10-15 03:05:29,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:05:29,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:29,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:05:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:29,773 INFO L87 Difference]: Start difference. First operand 399 states and 578 transitions. Second operand 6 states. [2019-10-15 03:05:29,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,871 INFO L93 Difference]: Finished difference Result 630 states and 923 transitions. [2019-10-15 03:05:29,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:29,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 03:05:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,876 INFO L225 Difference]: With dead ends: 630 [2019-10-15 03:05:29,876 INFO L226 Difference]: Without dead ends: 307 [2019-10-15 03:05:29,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-15 03:05:29,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 283. [2019-10-15 03:05:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-15 03:05:29,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 374 transitions. [2019-10-15 03:05:29,920 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 374 transitions. Word has length 55 [2019-10-15 03:05:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,920 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 374 transitions. [2019-10-15 03:05:29,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:05:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 374 transitions. [2019-10-15 03:05:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:29,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,921 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:29,922 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1129825869, now seen corresponding path program 1 times [2019-10-15 03:05:29,923 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540591798] [2019-10-15 03:05:29,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:30,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540591798] [2019-10-15 03:05:30,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:30,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267819131] [2019-10-15 03:05:30,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:30,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:30,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:30,112 INFO L87 Difference]: Start difference. First operand 283 states and 374 transitions. Second operand 10 states. [2019-10-15 03:05:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,356 INFO L93 Difference]: Finished difference Result 285 states and 375 transitions. [2019-10-15 03:05:30,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 03:05:30,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-10-15 03:05:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,359 INFO L225 Difference]: With dead ends: 285 [2019-10-15 03:05:30,359 INFO L226 Difference]: Without dead ends: 251 [2019-10-15 03:05:30,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-10-15 03:05:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2019-10-15 03:05:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-15 03:05:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 340 transitions. [2019-10-15 03:05:30,381 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 340 transitions. Word has length 50 [2019-10-15 03:05:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,382 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 340 transitions. [2019-10-15 03:05:30,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 340 transitions. [2019-10-15 03:05:30,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:05:30,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,383 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:30,383 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,383 INFO L82 PathProgramCache]: Analyzing trace with hash -854572919, now seen corresponding path program 1 times [2019-10-15 03:05:30,383 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007700495] [2019-10-15 03:05:30,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,384 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:30,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007700495] [2019-10-15 03:05:30,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:30,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400344934] [2019-10-15 03:05:30,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:30,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:30,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:30,442 INFO L87 Difference]: Start difference. First operand 251 states and 340 transitions. Second operand 5 states. [2019-10-15 03:05:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,713 INFO L93 Difference]: Finished difference Result 445 states and 607 transitions. [2019-10-15 03:05:30,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:30,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 03:05:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,715 INFO L225 Difference]: With dead ends: 445 [2019-10-15 03:05:30,716 INFO L226 Difference]: Without dead ends: 228 [2019-10-15 03:05:30,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-15 03:05:30,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-10-15 03:05:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-15 03:05:30,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 293 transitions. [2019-10-15 03:05:30,792 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 293 transitions. Word has length 59 [2019-10-15 03:05:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,792 INFO L462 AbstractCegarLoop]: Abstraction has 228 states and 293 transitions. [2019-10-15 03:05:30,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:30,792 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 293 transitions. [2019-10-15 03:05:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:05:30,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,793 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:30,794 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash -862739225, now seen corresponding path program 1 times [2019-10-15 03:05:30,794 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039750853] [2019-10-15 03:05:30,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,795 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:30,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039750853] [2019-10-15 03:05:30,924 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:30,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512597548] [2019-10-15 03:05:30,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:30,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:30,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:30,926 INFO L87 Difference]: Start difference. First operand 228 states and 293 transitions. Second operand 5 states. [2019-10-15 03:05:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:31,367 INFO L93 Difference]: Finished difference Result 508 states and 677 transitions. [2019-10-15 03:05:31,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:31,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-10-15 03:05:31,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:31,370 INFO L225 Difference]: With dead ends: 508 [2019-10-15 03:05:31,370 INFO L226 Difference]: Without dead ends: 314 [2019-10-15 03:05:31,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-15 03:05:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 276. [2019-10-15 03:05:31,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-15 03:05:31,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 362 transitions. [2019-10-15 03:05:31,403 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 362 transitions. Word has length 60 [2019-10-15 03:05:31,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:31,403 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 362 transitions. [2019-10-15 03:05:31,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:31,404 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 362 transitions. [2019-10-15 03:05:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:05:31,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:31,404 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:31,405 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1185194923, now seen corresponding path program 1 times [2019-10-15 03:05:31,406 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:31,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685848611] [2019-10-15 03:05:31,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:31,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685848611] [2019-10-15 03:05:31,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:31,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:31,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927924668] [2019-10-15 03:05:31,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:31,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:31,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:31,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:31,659 INFO L87 Difference]: Start difference. First operand 276 states and 362 transitions. Second operand 7 states. [2019-10-15 03:05:31,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:31,939 INFO L93 Difference]: Finished difference Result 317 states and 413 transitions. [2019-10-15 03:05:31,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:31,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-15 03:05:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:31,942 INFO L225 Difference]: With dead ends: 317 [2019-10-15 03:05:31,943 INFO L226 Difference]: Without dead ends: 313 [2019-10-15 03:05:31,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-10-15 03:05:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 291. [2019-10-15 03:05:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-15 03:05:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 382 transitions. [2019-10-15 03:05:31,973 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 382 transitions. Word has length 60 [2019-10-15 03:05:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:31,974 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 382 transitions. [2019-10-15 03:05:31,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:31,974 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 382 transitions. [2019-10-15 03:05:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-15 03:05:31,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:31,975 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:31,976 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:31,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:31,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2073242512, now seen corresponding path program 1 times [2019-10-15 03:05:31,976 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:31,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062498201] [2019-10-15 03:05:31,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:32,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062498201] [2019-10-15 03:05:32,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:32,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484979124] [2019-10-15 03:05:32,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:32,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:32,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:32,141 INFO L87 Difference]: Start difference. First operand 291 states and 382 transitions. Second operand 10 states. [2019-10-15 03:05:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:32,669 INFO L93 Difference]: Finished difference Result 488 states and 639 transitions. [2019-10-15 03:05:32,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:32,697 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-10-15 03:05:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:32,699 INFO L225 Difference]: With dead ends: 488 [2019-10-15 03:05:32,699 INFO L226 Difference]: Without dead ends: 262 [2019-10-15 03:05:32,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-15 03:05:32,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-10-15 03:05:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-15 03:05:32,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 337 transitions. [2019-10-15 03:05:32,732 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 337 transitions. Word has length 68 [2019-10-15 03:05:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:32,734 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 337 transitions. [2019-10-15 03:05:32,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 337 transitions. [2019-10-15 03:05:32,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 03:05:32,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:32,738 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:32,738 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:32,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:32,738 INFO L82 PathProgramCache]: Analyzing trace with hash 79636294, now seen corresponding path program 1 times [2019-10-15 03:05:32,739 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:32,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022461804] [2019-10-15 03:05:32,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:32,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022461804] [2019-10-15 03:05:32,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:05:32,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370193689] [2019-10-15 03:05:32,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:05:32,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:05:32,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:32,973 INFO L87 Difference]: Start difference. First operand 262 states and 337 transitions. Second operand 13 states. [2019-10-15 03:05:33,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:33,297 INFO L93 Difference]: Finished difference Result 284 states and 360 transitions. [2019-10-15 03:05:33,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:05:33,298 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-10-15 03:05:33,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:33,300 INFO L225 Difference]: With dead ends: 284 [2019-10-15 03:05:33,300 INFO L226 Difference]: Without dead ends: 260 [2019-10-15 03:05:33,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:05:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-15 03:05:33,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-10-15 03:05:33,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-15 03:05:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 333 transitions. [2019-10-15 03:05:33,325 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 333 transitions. Word has length 80 [2019-10-15 03:05:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:33,325 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 333 transitions. [2019-10-15 03:05:33,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:05:33,326 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 333 transitions. [2019-10-15 03:05:33,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-15 03:05:33,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:33,327 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:33,327 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash -624277236, now seen corresponding path program 1 times [2019-10-15 03:05:33,328 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:33,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449948967] [2019-10-15 03:05:33,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,328 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:33,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:33,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449948967] [2019-10-15 03:05:33,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:33,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 03:05:33,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921604855] [2019-10-15 03:05:33,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 03:05:33,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:33,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 03:05:33,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:05:33,621 INFO L87 Difference]: Start difference. First operand 260 states and 333 transitions. Second operand 14 states. [2019-10-15 03:05:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:35,247 INFO L93 Difference]: Finished difference Result 281 states and 354 transitions. [2019-10-15 03:05:35,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 03:05:35,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2019-10-15 03:05:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:35,250 INFO L225 Difference]: With dead ends: 281 [2019-10-15 03:05:35,250 INFO L226 Difference]: Without dead ends: 253 [2019-10-15 03:05:35,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:05:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-15 03:05:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2019-10-15 03:05:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-10-15 03:05:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 321 transitions. [2019-10-15 03:05:35,274 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 321 transitions. Word has length 87 [2019-10-15 03:05:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:35,275 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 321 transitions. [2019-10-15 03:05:35,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 03:05:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 321 transitions. [2019-10-15 03:05:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 03:05:35,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:35,277 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:35,277 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:35,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:35,277 INFO L82 PathProgramCache]: Analyzing trace with hash 680639073, now seen corresponding path program 1 times [2019-10-15 03:05:35,277 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:35,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771090981] [2019-10-15 03:05:35,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:35,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771090981] [2019-10-15 03:05:35,446 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:35,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:35,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99940144] [2019-10-15 03:05:35,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:35,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:35,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:35,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:35,447 INFO L87 Difference]: Start difference. First operand 251 states and 321 transitions. Second operand 7 states. [2019-10-15 03:05:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:35,719 INFO L93 Difference]: Finished difference Result 305 states and 386 transitions. [2019-10-15 03:05:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:35,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-10-15 03:05:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:35,722 INFO L225 Difference]: With dead ends: 305 [2019-10-15 03:05:35,722 INFO L226 Difference]: Without dead ends: 301 [2019-10-15 03:05:35,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-15 03:05:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 256. [2019-10-15 03:05:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-15 03:05:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 328 transitions. [2019-10-15 03:05:35,759 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 328 transitions. Word has length 99 [2019-10-15 03:05:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:35,761 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 328 transitions. [2019-10-15 03:05:35,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 328 transitions. [2019-10-15 03:05:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 03:05:35,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:35,762 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:35,763 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:35,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1503096704, now seen corresponding path program 1 times [2019-10-15 03:05:35,764 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:35,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834409848] [2019-10-15 03:05:35,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:35,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834409848] [2019-10-15 03:05:35,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:35,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:05:35,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7229526] [2019-10-15 03:05:35,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:05:35,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:35,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:05:35,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:35,952 INFO L87 Difference]: Start difference. First operand 256 states and 328 transitions. Second operand 13 states. [2019-10-15 03:05:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:36,130 INFO L93 Difference]: Finished difference Result 284 states and 360 transitions. [2019-10-15 03:05:36,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:05:36,130 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 92 [2019-10-15 03:05:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:36,132 INFO L225 Difference]: With dead ends: 284 [2019-10-15 03:05:36,133 INFO L226 Difference]: Without dead ends: 256 [2019-10-15 03:05:36,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:05:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-15 03:05:36,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2019-10-15 03:05:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-10-15 03:05:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 323 transitions. [2019-10-15 03:05:36,159 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 323 transitions. Word has length 92 [2019-10-15 03:05:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:36,159 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 323 transitions. [2019-10-15 03:05:36,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:05:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 323 transitions. [2019-10-15 03:05:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 03:05:36,161 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:36,161 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:36,162 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:36,162 INFO L82 PathProgramCache]: Analyzing trace with hash 762003235, now seen corresponding path program 1 times [2019-10-15 03:05:36,162 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:36,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154701488] [2019-10-15 03:05:36,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 03:05:36,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154701488] [2019-10-15 03:05:36,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:36,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:36,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859630064] [2019-10-15 03:05:36,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:36,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:36,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:36,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:36,264 INFO L87 Difference]: Start difference. First operand 254 states and 323 transitions. Second operand 5 states. [2019-10-15 03:05:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:36,896 INFO L93 Difference]: Finished difference Result 476 states and 586 transitions. [2019-10-15 03:05:36,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:36,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-15 03:05:36,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:36,900 INFO L225 Difference]: With dead ends: 476 [2019-10-15 03:05:36,900 INFO L226 Difference]: Without dead ends: 301 [2019-10-15 03:05:36,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-10-15 03:05:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 264. [2019-10-15 03:05:36,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-15 03:05:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 319 transitions. [2019-10-15 03:05:36,944 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 319 transitions. Word has length 107 [2019-10-15 03:05:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:36,944 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 319 transitions. [2019-10-15 03:05:36,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 319 transitions. [2019-10-15 03:05:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-15 03:05:36,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:36,946 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:36,946 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:36,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:36,947 INFO L82 PathProgramCache]: Analyzing trace with hash 643818800, now seen corresponding path program 1 times [2019-10-15 03:05:36,947 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:36,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443187035] [2019-10-15 03:05:36,947 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:37,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443187035] [2019-10-15 03:05:37,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:37,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 03:05:37,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488483832] [2019-10-15 03:05:37,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 03:05:37,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:37,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 03:05:37,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:05:37,480 INFO L87 Difference]: Start difference. First operand 264 states and 319 transitions. Second operand 14 states. [2019-10-15 03:05:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:39,383 INFO L93 Difference]: Finished difference Result 268 states and 321 transitions. [2019-10-15 03:05:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-15 03:05:39,383 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2019-10-15 03:05:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:39,385 INFO L225 Difference]: With dead ends: 268 [2019-10-15 03:05:39,385 INFO L226 Difference]: Without dead ends: 221 [2019-10-15 03:05:39,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2019-10-15 03:05:39,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-15 03:05:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 182. [2019-10-15 03:05:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-15 03:05:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 206 transitions. [2019-10-15 03:05:39,408 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 206 transitions. Word has length 99 [2019-10-15 03:05:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:39,409 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 206 transitions. [2019-10-15 03:05:39,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 03:05:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 206 transitions. [2019-10-15 03:05:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 03:05:39,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:39,412 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:39,412 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1156427461, now seen corresponding path program 1 times [2019-10-15 03:05:39,413 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:39,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740106508] [2019-10-15 03:05:39,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:39,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-15 03:05:39,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740106508] [2019-10-15 03:05:39,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:39,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:39,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320036995] [2019-10-15 03:05:39,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:39,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:39,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:39,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:39,751 INFO L87 Difference]: Start difference. First operand 182 states and 206 transitions. Second operand 7 states. [2019-10-15 03:05:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:40,126 INFO L93 Difference]: Finished difference Result 246 states and 279 transitions. [2019-10-15 03:05:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:40,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-10-15 03:05:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:40,129 INFO L225 Difference]: With dead ends: 246 [2019-10-15 03:05:40,129 INFO L226 Difference]: Without dead ends: 236 [2019-10-15 03:05:40,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-15 03:05:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 183. [2019-10-15 03:05:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-15 03:05:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 204 transitions. [2019-10-15 03:05:40,154 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 204 transitions. Word has length 132 [2019-10-15 03:05:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:40,154 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 204 transitions. [2019-10-15 03:05:40,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 204 transitions. [2019-10-15 03:05:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 03:05:40,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:40,157 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:40,157 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:40,158 INFO L82 PathProgramCache]: Analyzing trace with hash -583705189, now seen corresponding path program 1 times [2019-10-15 03:05:40,158 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:40,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657739177] [2019-10-15 03:05:40,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:40,158 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:40,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:40,551 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-15 03:05:40,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657739177] [2019-10-15 03:05:40,551 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782827531] [2019-10-15 03:05:40,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:05:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:40,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-15 03:05:40,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:05:41,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:05:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-15 03:05:41,109 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:05:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-15 03:05:41,896 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 03:05:41,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 17 [2019-10-15 03:05:41,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344759944] [2019-10-15 03:05:41,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:41,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:41,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-10-15 03:05:41,899 INFO L87 Difference]: Start difference. First operand 183 states and 204 transitions. Second operand 11 states. [2019-10-15 03:05:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:43,122 INFO L93 Difference]: Finished difference Result 230 states and 257 transitions. [2019-10-15 03:05:43,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:43,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 163 [2019-10-15 03:05:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:43,127 INFO L225 Difference]: With dead ends: 230 [2019-10-15 03:05:43,127 INFO L226 Difference]: Without dead ends: 220 [2019-10-15 03:05:43,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-10-15 03:05:43,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-15 03:05:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 164. [2019-10-15 03:05:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-15 03:05:43,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions. [2019-10-15 03:05:43,172 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 163 [2019-10-15 03:05:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:43,173 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 180 transitions. [2019-10-15 03:05:43,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:43,173 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions. [2019-10-15 03:05:43,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-15 03:05:43,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:43,175 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:43,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:05:43,433 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:43,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1692345567, now seen corresponding path program 1 times [2019-10-15 03:05:43,435 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:43,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551749069] [2019-10-15 03:05:43,435 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:43,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:43,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-15 03:05:43,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551749069] [2019-10-15 03:05:43,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:43,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:43,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959417255] [2019-10-15 03:05:43,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:43,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:43,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:43,833 INFO L87 Difference]: Start difference. First operand 164 states and 180 transitions. Second operand 7 states. [2019-10-15 03:05:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:44,218 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2019-10-15 03:05:44,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:44,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 165 [2019-10-15 03:05:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:44,220 INFO L225 Difference]: With dead ends: 202 [2019-10-15 03:05:44,220 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:05:44,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:05:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:05:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:05:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:05:44,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 165 [2019-10-15 03:05:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:44,222 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:05:44,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:05:44,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:05:44,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.