java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:05:11,221 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:05:11,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:05:11,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:05:11,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:05:11,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:05:11,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:05:11,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:05:11,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:05:11,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:05:11,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:05:11,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:05:11,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:05:11,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:05:11,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:05:11,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:05:11,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:05:11,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:05:11,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:05:11,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:05:11,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:05:11,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:05:11,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:05:11,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:05:11,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:05:11,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:05:11,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:05:11,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:05:11,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:05:11,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:05:11,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:05:11,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:05:11,265 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:05:11,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:05:11,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:05:11,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:05:11,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:05:11,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:05:11,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:05:11,269 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:05:11,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:05:11,270 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:11,285 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:05:11,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:05:11,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:05:11,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:05:11,286 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:05:11,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:05:11,287 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:05:11,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:05:11,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:05:11,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:05:11,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:05:11,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:05:11,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:05:11,288 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:05:11,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:05:11,289 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:05:11,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:05:11,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:05:11,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:05:11,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:05:11,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:05:11,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:05:11,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:05:11,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:05:11,291 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:05:11,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:05:11,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:05:11,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:05:11,291 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:11,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:05:11,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:05:11,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:05:11,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:05:11,657 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:05:11,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-10-15 03:05:11,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84b0ddb4/c2dcb2728659405899cd30513367433e/FLAG9b66d4f24 [2019-10-15 03:05:12,252 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:05:12,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-10-15 03:05:12,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84b0ddb4/c2dcb2728659405899cd30513367433e/FLAG9b66d4f24 [2019-10-15 03:05:12,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f84b0ddb4/c2dcb2728659405899cd30513367433e [2019-10-15 03:05:12,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:05:12,605 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:05:12,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:12,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:05:12,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:05:12,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:12" (1/1) ... [2019-10-15 03:05:12,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a36b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:12, skipping insertion in model container [2019-10-15 03:05:12,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:05:12" (1/1) ... [2019-10-15 03:05:12,639 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:05:12,729 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:05:13,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:13,290 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:05:13,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:05:13,424 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:05:13,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:13 WrapperNode [2019-10-15 03:05:13,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:05:13,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:05:13,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:05:13,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:05:13,437 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:13" (1/1) ... [2019-10-15 03:05:13,437 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:13" (1/1) ... [2019-10-15 03:05:13,455 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:13" (1/1) ... [2019-10-15 03:05:13,460 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:13" (1/1) ... [2019-10-15 03:05:13,492 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:13" (1/1) ... [2019-10-15 03:05:13,507 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:13" (1/1) ... [2019-10-15 03:05:13,512 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:13" (1/1) ... [2019-10-15 03:05:13,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:05:13,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:05:13,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:05:13,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:05:13,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:13" (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:13,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:05:13,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:05:13,590 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-15 03:05:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-15 03:05:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-15 03:05:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-15 03:05:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-15 03:05:13,591 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-15 03:05:13,592 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-15 03:05:13,592 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-15 03:05:13,592 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-15 03:05:13,592 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-15 03:05:13,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:05:13,593 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-15 03:05:13,593 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-15 03:05:13,593 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-15 03:05:13,593 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-15 03:05:13,593 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-15 03:05:13,594 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-15 03:05:13,594 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-15 03:05:13,594 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-15 03:05:13,594 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-15 03:05:13,595 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-15 03:05:13,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-15 03:05:13,595 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-15 03:05:13,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-15 03:05:13,596 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-15 03:05:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:05:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:05:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:05:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 03:05:13,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 03:05:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-15 03:05:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-15 03:05:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-15 03:05:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-15 03:05:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-15 03:05:13,598 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-15 03:05:13,598 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-15 03:05:13,598 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-15 03:05:13,598 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-15 03:05:13,598 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-15 03:05:13,598 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-15 03:05:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-15 03:05:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-15 03:05:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-15 03:05:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-15 03:05:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-15 03:05:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-15 03:05:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-15 03:05:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-15 03:05:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-15 03:05:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-15 03:05:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-15 03:05:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:05:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-15 03:05:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-15 03:05:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:05:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:05:13,911 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:13,981 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:13,982 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:13,992 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,013 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:14,013 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:14,030 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,301 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-15 03:05:14,301 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-15 03:05:14,304 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,395 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-10-15 03:05:14,396 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-10-15 03:05:14,412 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,444 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-15 03:05:14,445 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-15 03:05:14,561 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,587 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:14,588 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:14,589 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,609 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:14,610 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:14,610 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,626 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:14,627 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:14,683 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,725 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-15 03:05:14,726 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-15 03:05:14,776 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,792 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:14,793 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:14,793 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,820 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:14,821 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:14,821 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 03:05:14,836 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-15 03:05:14,837 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-15 03:05:15,256 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:05:15,257 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:05:15,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:15 BoogieIcfgContainer [2019-10-15 03:05:15,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:05:15,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:05:15,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:05:15,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:05:15,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:05:12" (1/3) ... [2019-10-15 03:05:15,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e92ba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:15, skipping insertion in model container [2019-10-15 03:05:15,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:05:13" (2/3) ... [2019-10-15 03:05:15,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e92ba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:05:15, skipping insertion in model container [2019-10-15 03:05:15,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:05:15" (3/3) ... [2019-10-15 03:05:15,274 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-10-15 03:05:15,284 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:05:15,295 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:05:15,307 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:05:15,356 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:05:15,357 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:05:15,357 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:05:15,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:05:15,357 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:05:15,357 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:05:15,357 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:05:15,357 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:05:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states. [2019-10-15 03:05:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:05:15,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:15,401 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:15,403 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:15,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:15,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1497224750, now seen corresponding path program 1 times [2019-10-15 03:05:15,418 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:15,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093697095] [2019-10-15 03:05:15,418 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:15,419 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:15,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:15,689 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,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093697095] [2019-10-15 03:05:15,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:15,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:15,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60726338] [2019-10-15 03:05:15,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:15,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:15,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:15,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:15,720 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 3 states. [2019-10-15 03:05:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:15,863 INFO L93 Difference]: Finished difference Result 397 states and 575 transitions. [2019-10-15 03:05:15,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:15,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 03:05:15,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:15,881 INFO L225 Difference]: With dead ends: 397 [2019-10-15 03:05:15,881 INFO L226 Difference]: Without dead ends: 227 [2019-10-15 03:05:15,887 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,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-15 03:05:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-10-15 03:05:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-15 03:05:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 297 transitions. [2019-10-15 03:05:15,975 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 297 transitions. Word has length 18 [2019-10-15 03:05:15,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:15,976 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 297 transitions. [2019-10-15 03:05:15,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:15,976 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 297 transitions. [2019-10-15 03:05:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:05:15,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:15,978 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] [2019-10-15 03:05:15,978 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:15,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash -726168722, now seen corresponding path program 1 times [2019-10-15 03:05:15,979 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:15,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913008648] [2019-10-15 03:05:15,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:15,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:15,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:16,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913008648] [2019-10-15 03:05:16,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:16,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:16,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120431386] [2019-10-15 03:05:16,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:16,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:16,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,224 INFO L87 Difference]: Start difference. First operand 227 states and 297 transitions. Second operand 3 states. [2019-10-15 03:05:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:16,438 INFO L93 Difference]: Finished difference Result 416 states and 544 transitions. [2019-10-15 03:05:16,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:16,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 03:05:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:16,443 INFO L225 Difference]: With dead ends: 416 [2019-10-15 03:05:16,443 INFO L226 Difference]: Without dead ends: 292 [2019-10-15 03:05:16,446 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:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-15 03:05:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2019-10-15 03:05:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-15 03:05:16,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 373 transitions. [2019-10-15 03:05:16,488 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 373 transitions. Word has length 22 [2019-10-15 03:05:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:16,489 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 373 transitions. [2019-10-15 03:05:16,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 373 transitions. [2019-10-15 03:05:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 03:05:16,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:16,491 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] [2019-10-15 03:05:16,491 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash -451141895, now seen corresponding path program 1 times [2019-10-15 03:05:16,492 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:16,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513556288] [2019-10-15 03:05:16,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:16,642 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,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513556288] [2019-10-15 03:05:16,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:16,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:16,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484200968] [2019-10-15 03:05:16,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:16,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:16,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:16,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,645 INFO L87 Difference]: Start difference. First operand 289 states and 373 transitions. Second operand 3 states. [2019-10-15 03:05:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:16,699 INFO L93 Difference]: Finished difference Result 605 states and 786 transitions. [2019-10-15 03:05:16,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:16,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 03:05:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:16,704 INFO L225 Difference]: With dead ends: 605 [2019-10-15 03:05:16,704 INFO L226 Difference]: Without dead ends: 443 [2019-10-15 03:05:16,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-15 03:05:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 415. [2019-10-15 03:05:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-10-15 03:05:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 542 transitions. [2019-10-15 03:05:16,752 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 542 transitions. Word has length 24 [2019-10-15 03:05:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:16,753 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 542 transitions. [2019-10-15 03:05:16,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 542 transitions. [2019-10-15 03:05:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 03:05:16,756 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:16,757 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] [2019-10-15 03:05:16,757 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:16,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash -59603234, now seen corresponding path program 1 times [2019-10-15 03:05:16,757 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:16,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871324628] [2019-10-15 03:05:16,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,758 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:16,848 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,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871324628] [2019-10-15 03:05:16,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:16,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:16,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742556964] [2019-10-15 03:05:16,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:16,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:16,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:16,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,851 INFO L87 Difference]: Start difference. First operand 415 states and 542 transitions. Second operand 3 states. [2019-10-15 03:05:16,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:16,895 INFO L93 Difference]: Finished difference Result 484 states and 628 transitions. [2019-10-15 03:05:16,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:16,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-15 03:05:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:16,900 INFO L225 Difference]: With dead ends: 484 [2019-10-15 03:05:16,900 INFO L226 Difference]: Without dead ends: 466 [2019-10-15 03:05:16,901 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:16,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-15 03:05:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 450. [2019-10-15 03:05:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-15 03:05:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 584 transitions. [2019-10-15 03:05:16,936 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 584 transitions. Word has length 28 [2019-10-15 03:05:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:16,936 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 584 transitions. [2019-10-15 03:05:16,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 584 transitions. [2019-10-15 03:05:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 03:05:16,939 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:16,939 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] [2019-10-15 03:05:16,939 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:16,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:16,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1687296961, now seen corresponding path program 1 times [2019-10-15 03:05:16,940 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:16,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807258712] [2019-10-15 03:05:16,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:16,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:17,010 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,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807258712] [2019-10-15 03:05:17,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:17,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:17,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304732999] [2019-10-15 03:05:17,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:17,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:17,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:17,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:17,013 INFO L87 Difference]: Start difference. First operand 450 states and 584 transitions. Second operand 3 states. [2019-10-15 03:05:17,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:17,145 INFO L93 Difference]: Finished difference Result 459 states and 595 transitions. [2019-10-15 03:05:17,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:17,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 03:05:17,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:17,150 INFO L225 Difference]: With dead ends: 459 [2019-10-15 03:05:17,150 INFO L226 Difference]: Without dead ends: 456 [2019-10-15 03:05:17,151 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:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-15 03:05:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-10-15 03:05:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-15 03:05:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 591 transitions. [2019-10-15 03:05:17,184 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 591 transitions. Word has length 32 [2019-10-15 03:05:17,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:17,185 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 591 transitions. [2019-10-15 03:05:17,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:17,185 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 591 transitions. [2019-10-15 03:05:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 03:05:17,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:17,188 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:17,189 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:17,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1068938519, now seen corresponding path program 1 times [2019-10-15 03:05:17,189 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:17,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425883208] [2019-10-15 03:05:17,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:17,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425883208] [2019-10-15 03:05:17,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:17,253 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:17,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098662183] [2019-10-15 03:05:17,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:17,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:17,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:17,254 INFO L87 Difference]: Start difference. First operand 456 states and 591 transitions. Second operand 3 states. [2019-10-15 03:05:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:17,384 INFO L93 Difference]: Finished difference Result 605 states and 798 transitions. [2019-10-15 03:05:17,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:17,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-15 03:05:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:17,389 INFO L225 Difference]: With dead ends: 605 [2019-10-15 03:05:17,389 INFO L226 Difference]: Without dead ends: 602 [2019-10-15 03:05:17,390 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,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-15 03:05:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 502. [2019-10-15 03:05:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-15 03:05:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2019-10-15 03:05:17,420 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 35 [2019-10-15 03:05:17,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:17,421 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2019-10-15 03:05:17,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2019-10-15 03:05:17,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 03:05:17,423 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:17,423 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:17,424 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:17,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:17,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1155855189, now seen corresponding path program 1 times [2019-10-15 03:05:17,424 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:17,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100303535] [2019-10-15 03:05:17,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:17,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100303535] [2019-10-15 03:05:17,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:17,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:17,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777711289] [2019-10-15 03:05:17,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:17,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:17,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:17,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:17,491 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 3 states. [2019-10-15 03:05:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:17,569 INFO L93 Difference]: Finished difference Result 530 states and 687 transitions. [2019-10-15 03:05:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:17,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-15 03:05:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:17,573 INFO L225 Difference]: With dead ends: 530 [2019-10-15 03:05:17,573 INFO L226 Difference]: Without dead ends: 525 [2019-10-15 03:05:17,574 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,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-10-15 03:05:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 523. [2019-10-15 03:05:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-15 03:05:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 680 transitions. [2019-10-15 03:05:17,602 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 680 transitions. Word has length 35 [2019-10-15 03:05:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:17,603 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 680 transitions. [2019-10-15 03:05:17,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 680 transitions. [2019-10-15 03:05:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 03:05:17,604 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:17,604 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] [2019-10-15 03:05:17,605 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:17,605 INFO L82 PathProgramCache]: Analyzing trace with hash 984815367, now seen corresponding path program 1 times [2019-10-15 03:05:17,605 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:17,606 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805783095] [2019-10-15 03:05:17,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,606 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:17,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:17,798 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,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805783095] [2019-10-15 03:05:17,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:17,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:17,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451310868] [2019-10-15 03:05:17,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:17,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:17,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:17,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:17,803 INFO L87 Difference]: Start difference. First operand 523 states and 680 transitions. Second operand 8 states. [2019-10-15 03:05:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:19,137 INFO L93 Difference]: Finished difference Result 689 states and 894 transitions. [2019-10-15 03:05:19,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:19,138 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-10-15 03:05:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:19,144 INFO L225 Difference]: With dead ends: 689 [2019-10-15 03:05:19,144 INFO L226 Difference]: Without dead ends: 620 [2019-10-15 03:05:19,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:19,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-15 03:05:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 517. [2019-10-15 03:05:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-10-15 03:05:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 666 transitions. [2019-10-15 03:05:19,186 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 666 transitions. Word has length 36 [2019-10-15 03:05:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:19,186 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 666 transitions. [2019-10-15 03:05:19,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 666 transitions. [2019-10-15 03:05:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 03:05:19,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:19,189 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] [2019-10-15 03:05:19,189 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:19,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1019894896, now seen corresponding path program 1 times [2019-10-15 03:05:19,190 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:19,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053504071] [2019-10-15 03:05:19,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:19,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:19,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:19,285 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,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053504071] [2019-10-15 03:05:19,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:19,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:19,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629930161] [2019-10-15 03:05:19,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:19,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:19,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:19,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:19,287 INFO L87 Difference]: Start difference. First operand 517 states and 666 transitions. Second operand 8 states. [2019-10-15 03:05:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:20,059 INFO L93 Difference]: Finished difference Result 539 states and 688 transitions. [2019-10-15 03:05:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:20,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-10-15 03:05:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:20,064 INFO L225 Difference]: With dead ends: 539 [2019-10-15 03:05:20,065 INFO L226 Difference]: Without dead ends: 533 [2019-10-15 03:05:20,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:20,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-15 03:05:20,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 517. [2019-10-15 03:05:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-10-15 03:05:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 665 transitions. [2019-10-15 03:05:20,129 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 665 transitions. Word has length 36 [2019-10-15 03:05:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:20,130 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 665 transitions. [2019-10-15 03:05:20,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 665 transitions. [2019-10-15 03:05:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 03:05:20,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:20,131 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:20,132 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:20,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1882604984, now seen corresponding path program 1 times [2019-10-15 03:05:20,132 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:20,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327225355] [2019-10-15 03:05:20,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:20,133 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:20,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:20,245 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,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327225355] [2019-10-15 03:05:20,247 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:20,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:20,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551029644] [2019-10-15 03:05:20,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:20,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:20,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:20,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:20,250 INFO L87 Difference]: Start difference. First operand 517 states and 665 transitions. Second operand 8 states. [2019-10-15 03:05:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,014 INFO L93 Difference]: Finished difference Result 539 states and 686 transitions. [2019-10-15 03:05:21,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:21,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-10-15 03:05:21,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,019 INFO L225 Difference]: With dead ends: 539 [2019-10-15 03:05:21,019 INFO L226 Difference]: Without dead ends: 533 [2019-10-15 03:05:21,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-15 03:05:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 517. [2019-10-15 03:05:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-10-15 03:05:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 664 transitions. [2019-10-15 03:05:21,065 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 664 transitions. Word has length 37 [2019-10-15 03:05:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,065 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 664 transitions. [2019-10-15 03:05:21,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 664 transitions. [2019-10-15 03:05:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 03:05:21,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,068 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] [2019-10-15 03:05:21,068 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1685011911, now seen corresponding path program 1 times [2019-10-15 03:05:21,069 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236611642] [2019-10-15 03:05:21,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:21,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236611642] [2019-10-15 03:05:21,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:21,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681029145] [2019-10-15 03:05:21,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:21,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:21,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:21,142 INFO L87 Difference]: Start difference. First operand 517 states and 664 transitions. Second operand 5 states. [2019-10-15 03:05:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,188 INFO L93 Difference]: Finished difference Result 533 states and 679 transitions. [2019-10-15 03:05:21,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:21,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-15 03:05:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,193 INFO L225 Difference]: With dead ends: 533 [2019-10-15 03:05:21,193 INFO L226 Difference]: Without dead ends: 515 [2019-10-15 03:05:21,194 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:21,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-10-15 03:05:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-10-15 03:05:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-10-15 03:05:21,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 660 transitions. [2019-10-15 03:05:21,253 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 660 transitions. Word has length 38 [2019-10-15 03:05:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,253 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 660 transitions. [2019-10-15 03:05:21,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:21,254 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 660 transitions. [2019-10-15 03:05:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:05:21,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,255 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:21,255 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash 772670357, now seen corresponding path program 1 times [2019-10-15 03:05:21,256 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110074696] [2019-10-15 03:05:21,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,256 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,325 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,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110074696] [2019-10-15 03:05:21,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:05:21,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630172831] [2019-10-15 03:05:21,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:05:21,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:05:21,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:05:21,327 INFO L87 Difference]: Start difference. First operand 515 states and 660 transitions. Second operand 4 states. [2019-10-15 03:05:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,501 INFO L93 Difference]: Finished difference Result 565 states and 704 transitions. [2019-10-15 03:05:21,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:05:21,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-10-15 03:05:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,505 INFO L225 Difference]: With dead ends: 565 [2019-10-15 03:05:21,505 INFO L226 Difference]: Without dead ends: 376 [2019-10-15 03:05:21,506 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:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-15 03:05:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 357. [2019-10-15 03:05:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-15 03:05:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 436 transitions. [2019-10-15 03:05:21,531 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 436 transitions. Word has length 40 [2019-10-15 03:05:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,532 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 436 transitions. [2019-10-15 03:05:21,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:05:21,532 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 436 transitions. [2019-10-15 03:05:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:05:21,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,535 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] [2019-10-15 03:05:21,535 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1299782882, now seen corresponding path program 1 times [2019-10-15 03:05:21,536 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999759155] [2019-10-15 03:05:21,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,597 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,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999759155] [2019-10-15 03:05:21,598 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:21,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937110895] [2019-10-15 03:05:21,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:21,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:21,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:21,600 INFO L87 Difference]: Start difference. First operand 357 states and 436 transitions. Second operand 3 states. [2019-10-15 03:05:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,668 INFO L93 Difference]: Finished difference Result 538 states and 668 transitions. [2019-10-15 03:05:21,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:21,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-15 03:05:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,671 INFO L225 Difference]: With dead ends: 538 [2019-10-15 03:05:21,671 INFO L226 Difference]: Without dead ends: 360 [2019-10-15 03:05:21,672 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:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-10-15 03:05:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-10-15 03:05:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-15 03:05:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 440 transitions. [2019-10-15 03:05:21,695 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 440 transitions. Word has length 48 [2019-10-15 03:05:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,695 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 440 transitions. [2019-10-15 03:05:21,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 440 transitions. [2019-10-15 03:05:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:05:21,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,697 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:21,698 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1887771739, now seen corresponding path program 1 times [2019-10-15 03:05:21,699 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297372398] [2019-10-15 03:05:21,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,850 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,850 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297372398] [2019-10-15 03:05:21,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:21,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131754410] [2019-10-15 03:05:21,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:21,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:21,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:21,853 INFO L87 Difference]: Start difference. First operand 360 states and 440 transitions. Second operand 5 states. [2019-10-15 03:05:21,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:21,886 INFO L93 Difference]: Finished difference Result 534 states and 661 transitions. [2019-10-15 03:05:21,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:21,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-15 03:05:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:21,889 INFO L225 Difference]: With dead ends: 534 [2019-10-15 03:05:21,889 INFO L226 Difference]: Without dead ends: 353 [2019-10-15 03:05:21,891 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:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-10-15 03:05:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2019-10-15 03:05:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-10-15 03:05:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 428 transitions. [2019-10-15 03:05:21,913 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 428 transitions. Word has length 50 [2019-10-15 03:05:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:21,914 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 428 transitions. [2019-10-15 03:05:21,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:21,914 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 428 transitions. [2019-10-15 03:05:21,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:05:21,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:21,917 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:21,917 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:21,917 INFO L82 PathProgramCache]: Analyzing trace with hash -445964506, now seen corresponding path program 1 times [2019-10-15 03:05:21,918 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:21,918 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275624634] [2019-10-15 03:05:21,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:21,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:21,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275624634] [2019-10-15 03:05:21,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:21,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:21,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980791087] [2019-10-15 03:05:21,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:21,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:21,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:21,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:21,967 INFO L87 Difference]: Start difference. First operand 353 states and 428 transitions. Second operand 3 states. [2019-10-15 03:05:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:22,070 INFO L93 Difference]: Finished difference Result 493 states and 614 transitions. [2019-10-15 03:05:22,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:22,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 03:05:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:22,074 INFO L225 Difference]: With dead ends: 493 [2019-10-15 03:05:22,074 INFO L226 Difference]: Without dead ends: 485 [2019-10-15 03:05:22,077 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:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-15 03:05:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 393. [2019-10-15 03:05:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-10-15 03:05:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 478 transitions. [2019-10-15 03:05:22,126 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 478 transitions. Word has length 43 [2019-10-15 03:05:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:22,126 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 478 transitions. [2019-10-15 03:05:22,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 478 transitions. [2019-10-15 03:05:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:05:22,128 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:22,128 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:22,128 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:22,129 INFO L82 PathProgramCache]: Analyzing trace with hash -488120203, now seen corresponding path program 1 times [2019-10-15 03:05:22,129 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:22,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848910873] [2019-10-15 03:05:22,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:22,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:22,247 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,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848910873] [2019-10-15 03:05:22,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:22,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:22,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132964912] [2019-10-15 03:05:22,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:22,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:22,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:22,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:22,252 INFO L87 Difference]: Start difference. First operand 393 states and 478 transitions. Second operand 10 states. [2019-10-15 03:05:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:23,641 INFO L93 Difference]: Finished difference Result 439 states and 530 transitions. [2019-10-15 03:05:23,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 03:05:23,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-10-15 03:05:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:23,645 INFO L225 Difference]: With dead ends: 439 [2019-10-15 03:05:23,645 INFO L226 Difference]: Without dead ends: 435 [2019-10-15 03:05:23,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:05:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-15 03:05:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-10-15 03:05:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-10-15 03:05:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 523 transitions. [2019-10-15 03:05:23,673 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 523 transitions. Word has length 44 [2019-10-15 03:05:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:23,673 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 523 transitions. [2019-10-15 03:05:23,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 523 transitions. [2019-10-15 03:05:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:05:23,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:23,675 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:23,675 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash -487843373, now seen corresponding path program 1 times [2019-10-15 03:05:23,676 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:23,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854841275] [2019-10-15 03:05:23,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,676 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:23,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:23,807 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,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854841275] [2019-10-15 03:05:23,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:23,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:23,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322837661] [2019-10-15 03:05:23,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:23,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:23,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:23,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:23,810 INFO L87 Difference]: Start difference. First operand 431 states and 523 transitions. Second operand 8 states. [2019-10-15 03:05:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:24,091 INFO L93 Difference]: Finished difference Result 463 states and 559 transitions. [2019-10-15 03:05:24,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:24,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-15 03:05:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:24,095 INFO L225 Difference]: With dead ends: 463 [2019-10-15 03:05:24,095 INFO L226 Difference]: Without dead ends: 447 [2019-10-15 03:05:24,097 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:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-15 03:05:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 439. [2019-10-15 03:05:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-15 03:05:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 532 transitions. [2019-10-15 03:05:24,130 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 532 transitions. Word has length 44 [2019-10-15 03:05:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:24,131 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 532 transitions. [2019-10-15 03:05:24,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 532 transitions. [2019-10-15 03:05:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 03:05:24,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:24,133 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:24,133 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1717538634, now seen corresponding path program 1 times [2019-10-15 03:05:24,134 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:24,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290327540] [2019-10-15 03:05:24,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:24,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:24,245 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,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290327540] [2019-10-15 03:05:24,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:24,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:24,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345022569] [2019-10-15 03:05:24,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:24,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:24,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:24,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:24,247 INFO L87 Difference]: Start difference. First operand 439 states and 532 transitions. Second operand 7 states. [2019-10-15 03:05:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:24,969 INFO L93 Difference]: Finished difference Result 500 states and 609 transitions. [2019-10-15 03:05:24,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:24,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-10-15 03:05:24,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:24,973 INFO L225 Difference]: With dead ends: 500 [2019-10-15 03:05:24,973 INFO L226 Difference]: Without dead ends: 439 [2019-10-15 03:05:24,974 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-10-15 03:05:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-10-15 03:05:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-15 03:05:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 530 transitions. [2019-10-15 03:05:25,014 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 530 transitions. Word has length 44 [2019-10-15 03:05:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:25,015 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 530 transitions. [2019-10-15 03:05:25,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 530 transitions. [2019-10-15 03:05:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 03:05:25,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:25,018 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] [2019-10-15 03:05:25,018 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash 462464929, now seen corresponding path program 1 times [2019-10-15 03:05:25,019 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:25,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155663104] [2019-10-15 03:05:25,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:25,126 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:25,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155663104] [2019-10-15 03:05:25,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:25,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:25,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214887479] [2019-10-15 03:05:25,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:25,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:25,131 INFO L87 Difference]: Start difference. First operand 439 states and 530 transitions. Second operand 3 states. [2019-10-15 03:05:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:25,249 INFO L93 Difference]: Finished difference Result 461 states and 552 transitions. [2019-10-15 03:05:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:25,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-15 03:05:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:25,254 INFO L225 Difference]: With dead ends: 461 [2019-10-15 03:05:25,254 INFO L226 Difference]: Without dead ends: 447 [2019-10-15 03:05:25,255 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:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-15 03:05:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 435. [2019-10-15 03:05:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-15 03:05:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 521 transitions. [2019-10-15 03:05:25,301 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 521 transitions. Word has length 45 [2019-10-15 03:05:25,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:25,302 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 521 transitions. [2019-10-15 03:05:25,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 521 transitions. [2019-10-15 03:05:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:05:25,304 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:25,304 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:25,305 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:25,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:25,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1389938668, now seen corresponding path program 1 times [2019-10-15 03:05:25,306 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:25,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222654284] [2019-10-15 03:05:25,306 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,306 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:25,424 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:25,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222654284] [2019-10-15 03:05:25,425 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:25,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:25,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689581746] [2019-10-15 03:05:25,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:25,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:25,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:25,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:25,427 INFO L87 Difference]: Start difference. First operand 435 states and 521 transitions. Second operand 5 states. [2019-10-15 03:05:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:25,945 INFO L93 Difference]: Finished difference Result 613 states and 744 transitions. [2019-10-15 03:05:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:25,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-15 03:05:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:25,949 INFO L225 Difference]: With dead ends: 613 [2019-10-15 03:05:25,950 INFO L226 Difference]: Without dead ends: 435 [2019-10-15 03:05:25,951 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:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-15 03:05:25,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-10-15 03:05:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-15 03:05:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 520 transitions. [2019-10-15 03:05:25,987 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 520 transitions. Word has length 54 [2019-10-15 03:05:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:25,988 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 520 transitions. [2019-10-15 03:05:25,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:25,988 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 520 transitions. [2019-10-15 03:05:25,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 03:05:25,990 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:25,990 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:25,990 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:25,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:25,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1903388506, now seen corresponding path program 1 times [2019-10-15 03:05:25,991 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:25,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42564568] [2019-10-15 03:05:25,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:25,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:26,073 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,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42564568] [2019-10-15 03:05:26,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:26,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:26,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322411642] [2019-10-15 03:05:26,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:26,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:26,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:26,076 INFO L87 Difference]: Start difference. First operand 435 states and 520 transitions. Second operand 5 states. [2019-10-15 03:05:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:26,438 INFO L93 Difference]: Finished difference Result 449 states and 533 transitions. [2019-10-15 03:05:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:26,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-15 03:05:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:26,442 INFO L225 Difference]: With dead ends: 449 [2019-10-15 03:05:26,442 INFO L226 Difference]: Without dead ends: 431 [2019-10-15 03:05:26,443 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:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-15 03:05:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2019-10-15 03:05:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-15 03:05:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 506 transitions. [2019-10-15 03:05:26,472 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 506 transitions. Word has length 46 [2019-10-15 03:05:26,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:26,472 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 506 transitions. [2019-10-15 03:05:26,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 506 transitions. [2019-10-15 03:05:26,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:05:26,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:26,474 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:26,474 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:26,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash -234491934, now seen corresponding path program 1 times [2019-10-15 03:05:26,475 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:26,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824026194] [2019-10-15 03:05:26,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:26,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:26,587 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,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824026194] [2019-10-15 03:05:26,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:26,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:26,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40120815] [2019-10-15 03:05:26,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:26,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:26,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:26,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:26,589 INFO L87 Difference]: Start difference. First operand 423 states and 506 transitions. Second operand 7 states. [2019-10-15 03:05:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:27,237 INFO L93 Difference]: Finished difference Result 430 states and 514 transitions. [2019-10-15 03:05:27,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:27,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-15 03:05:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:27,243 INFO L225 Difference]: With dead ends: 430 [2019-10-15 03:05:27,243 INFO L226 Difference]: Without dead ends: 427 [2019-10-15 03:05:27,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-15 03:05:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-10-15 03:05:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-15 03:05:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 506 transitions. [2019-10-15 03:05:27,273 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 506 transitions. Word has length 55 [2019-10-15 03:05:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:27,273 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 506 transitions. [2019-10-15 03:05:27,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 506 transitions. [2019-10-15 03:05:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:05:27,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,275 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] [2019-10-15 03:05:27,276 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,276 INFO L82 PathProgramCache]: Analyzing trace with hash 163990782, now seen corresponding path program 1 times [2019-10-15 03:05:27,276 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435941536] [2019-10-15 03:05:27,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:27,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:27,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435941536] [2019-10-15 03:05:27,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:27,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:27,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555985508] [2019-10-15 03:05:27,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:27,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:27,518 INFO L87 Difference]: Start difference. First operand 423 states and 506 transitions. Second operand 9 states. [2019-10-15 03:05:27,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:27,957 INFO L93 Difference]: Finished difference Result 448 states and 531 transitions. [2019-10-15 03:05:27,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:27,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-10-15 03:05:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:27,961 INFO L225 Difference]: With dead ends: 448 [2019-10-15 03:05:27,961 INFO L226 Difference]: Without dead ends: 418 [2019-10-15 03:05:27,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-15 03:05:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2019-10-15 03:05:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-10-15 03:05:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 498 transitions. [2019-10-15 03:05:27,995 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 498 transitions. Word has length 47 [2019-10-15 03:05:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:27,995 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 498 transitions. [2019-10-15 03:05:27,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 498 transitions. [2019-10-15 03:05:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:05:27,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:27,998 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] [2019-10-15 03:05:27,998 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:27,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:27,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1254376986, now seen corresponding path program 1 times [2019-10-15 03:05:27,998 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:27,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249986225] [2019-10-15 03:05:27,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:27,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,083 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,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249986225] [2019-10-15 03:05:28,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:28,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585445805] [2019-10-15 03:05:28,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:28,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:28,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:28,085 INFO L87 Difference]: Start difference. First operand 418 states and 498 transitions. Second operand 9 states. [2019-10-15 03:05:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,263 INFO L93 Difference]: Finished difference Result 443 states and 523 transitions. [2019-10-15 03:05:28,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:28,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-10-15 03:05:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,266 INFO L225 Difference]: With dead ends: 443 [2019-10-15 03:05:28,266 INFO L226 Difference]: Without dead ends: 413 [2019-10-15 03:05:28,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-15 03:05:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2019-10-15 03:05:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-10-15 03:05:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 490 transitions. [2019-10-15 03:05:28,299 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 490 transitions. Word has length 47 [2019-10-15 03:05:28,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,300 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 490 transitions. [2019-10-15 03:05:28,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:28,300 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 490 transitions. [2019-10-15 03:05:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 03:05:28,302 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,302 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] [2019-10-15 03:05:28,302 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1889673940, now seen corresponding path program 1 times [2019-10-15 03:05:28,303 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38606007] [2019-10-15 03:05:28,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,379 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,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38606007] [2019-10-15 03:05:28,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:05:28,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094101642] [2019-10-15 03:05:28,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:05:28,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:05:28,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:28,382 INFO L87 Difference]: Start difference. First operand 413 states and 490 transitions. Second operand 6 states. [2019-10-15 03:05:28,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,487 INFO L93 Difference]: Finished difference Result 430 states and 506 transitions. [2019-10-15 03:05:28,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:28,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-15 03:05:28,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,490 INFO L225 Difference]: With dead ends: 430 [2019-10-15 03:05:28,490 INFO L226 Difference]: Without dead ends: 395 [2019-10-15 03:05:28,491 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,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-15 03:05:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2019-10-15 03:05:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-15 03:05:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 468 transitions. [2019-10-15 03:05:28,522 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 468 transitions. Word has length 49 [2019-10-15 03:05:28,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,524 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 468 transitions. [2019-10-15 03:05:28,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:05:28,524 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 468 transitions. [2019-10-15 03:05:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-15 03:05:28,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,526 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] [2019-10-15 03:05:28,526 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1075527803, now seen corresponding path program 1 times [2019-10-15 03:05:28,527 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954433350] [2019-10-15 03:05:28,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,642 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,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954433350] [2019-10-15 03:05:28,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:28,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003709467] [2019-10-15 03:05:28,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:28,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:28,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:28,645 INFO L87 Difference]: Start difference. First operand 395 states and 468 transitions. Second operand 9 states. [2019-10-15 03:05:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:28,889 INFO L93 Difference]: Finished difference Result 420 states and 493 transitions. [2019-10-15 03:05:28,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:28,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-10-15 03:05:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:28,893 INFO L225 Difference]: With dead ends: 420 [2019-10-15 03:05:28,894 INFO L226 Difference]: Without dead ends: 390 [2019-10-15 03:05:28,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:28,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-10-15 03:05:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2019-10-15 03:05:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-10-15 03:05:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 460 transitions. [2019-10-15 03:05:28,924 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 460 transitions. Word has length 48 [2019-10-15 03:05:28,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:28,924 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 460 transitions. [2019-10-15 03:05:28,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 460 transitions. [2019-10-15 03:05:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-15 03:05:28,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:28,926 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] [2019-10-15 03:05:28,926 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:28,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:28,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1669746933, now seen corresponding path program 1 times [2019-10-15 03:05:28,927 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:28,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292035343] [2019-10-15 03:05:28,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:28,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:28,983 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,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292035343] [2019-10-15 03:05:28,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:28,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:05:28,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552149186] [2019-10-15 03:05:28,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:05:28,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:28,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:05:28,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:05:28,985 INFO L87 Difference]: Start difference. First operand 390 states and 460 transitions. Second operand 3 states. [2019-10-15 03:05:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,019 INFO L93 Difference]: Finished difference Result 639 states and 766 transitions. [2019-10-15 03:05:29,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:05:29,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-15 03:05:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,022 INFO L225 Difference]: With dead ends: 639 [2019-10-15 03:05:29,022 INFO L226 Difference]: Without dead ends: 467 [2019-10-15 03:05:29,023 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:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-15 03:05:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 440. [2019-10-15 03:05:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-15 03:05:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 522 transitions. [2019-10-15 03:05:29,060 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 522 transitions. Word has length 57 [2019-10-15 03:05:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,060 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 522 transitions. [2019-10-15 03:05:29,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:05:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 522 transitions. [2019-10-15 03:05:29,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:05:29,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,062 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] [2019-10-15 03:05:29,062 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1369679451, now seen corresponding path program 1 times [2019-10-15 03:05:29,063 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076754807] [2019-10-15 03:05:29,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,064 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:29,150 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,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076754807] [2019-10-15 03:05:29,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:29,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:29,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135244332] [2019-10-15 03:05:29,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:29,152 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:29,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:29,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:29,152 INFO L87 Difference]: Start difference. First operand 440 states and 522 transitions. Second operand 9 states. [2019-10-15 03:05:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:29,450 INFO L93 Difference]: Finished difference Result 465 states and 547 transitions. [2019-10-15 03:05:29,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:29,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-15 03:05:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:29,454 INFO L225 Difference]: With dead ends: 465 [2019-10-15 03:05:29,454 INFO L226 Difference]: Without dead ends: 411 [2019-10-15 03:05:29,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-15 03:05:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2019-10-15 03:05:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-15 03:05:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 486 transitions. [2019-10-15 03:05:29,486 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 486 transitions. Word has length 51 [2019-10-15 03:05:29,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:29,486 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 486 transitions. [2019-10-15 03:05:29,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 486 transitions. [2019-10-15 03:05:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-15 03:05:29,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:29,488 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] [2019-10-15 03:05:29,488 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:29,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:29,488 INFO L82 PathProgramCache]: Analyzing trace with hash -685045101, now seen corresponding path program 1 times [2019-10-15 03:05:29,489 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:29,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731117150] [2019-10-15 03:05:29,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,489 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:29,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:29,617 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,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731117150] [2019-10-15 03:05:29,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:29,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:29,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687497] [2019-10-15 03:05:29,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:29,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:29,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:29,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:29,620 INFO L87 Difference]: Start difference. First operand 411 states and 486 transitions. Second operand 9 states. [2019-10-15 03:05:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:30,228 INFO L93 Difference]: Finished difference Result 445 states and 520 transitions. [2019-10-15 03:05:30,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:30,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-15 03:05:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:30,231 INFO L225 Difference]: With dead ends: 445 [2019-10-15 03:05:30,231 INFO L226 Difference]: Without dead ends: 409 [2019-10-15 03:05:30,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:05:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-15 03:05:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-15 03:05:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-15 03:05:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 481 transitions. [2019-10-15 03:05:30,264 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 481 transitions. Word has length 63 [2019-10-15 03:05:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:30,264 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 481 transitions. [2019-10-15 03:05:30,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 481 transitions. [2019-10-15 03:05:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-15 03:05:30,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:30,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, 1, 1, 1, 1, 1, 1, 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,267 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:30,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:30,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1281989941, now seen corresponding path program 1 times [2019-10-15 03:05:30,267 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:30,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583267945] [2019-10-15 03:05:30,267 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:30,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:30,371 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,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583267945] [2019-10-15 03:05:30,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:30,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:05:30,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682892640] [2019-10-15 03:05:30,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:05:30,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:30,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:05:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:30,374 INFO L87 Difference]: Start difference. First operand 409 states and 481 transitions. Second operand 8 states. [2019-10-15 03:05:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:31,095 INFO L93 Difference]: Finished difference Result 491 states and 590 transitions. [2019-10-15 03:05:31,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:31,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-10-15 03:05:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:31,098 INFO L225 Difference]: With dead ends: 491 [2019-10-15 03:05:31,098 INFO L226 Difference]: Without dead ends: 487 [2019-10-15 03:05:31,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-15 03:05:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 409. [2019-10-15 03:05:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-15 03:05:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 481 transitions. [2019-10-15 03:05:31,146 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 481 transitions. Word has length 64 [2019-10-15 03:05:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:31,147 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 481 transitions. [2019-10-15 03:05:31,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:05:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 481 transitions. [2019-10-15 03:05:31,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-15 03:05:31,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:31,149 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:31,150 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:31,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1003050700, now seen corresponding path program 1 times [2019-10-15 03:05:31,151 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:31,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195985039] [2019-10-15 03:05:31,151 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,152 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:31,291 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,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195985039] [2019-10-15 03:05:31,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:31,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:31,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76748724] [2019-10-15 03:05:31,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:31,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:31,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:31,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:31,295 INFO L87 Difference]: Start difference. First operand 409 states and 481 transitions. Second operand 5 states. [2019-10-15 03:05:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:31,738 INFO L93 Difference]: Finished difference Result 713 states and 815 transitions. [2019-10-15 03:05:31,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 03:05:31,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-15 03:05:31,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:31,742 INFO L225 Difference]: With dead ends: 713 [2019-10-15 03:05:31,742 INFO L226 Difference]: Without dead ends: 460 [2019-10-15 03:05:31,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-10-15 03:05:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 440. [2019-10-15 03:05:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-15 03:05:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 505 transitions. [2019-10-15 03:05:31,818 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 505 transitions. Word has length 59 [2019-10-15 03:05:31,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:31,818 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 505 transitions. [2019-10-15 03:05:31,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 505 transitions. [2019-10-15 03:05:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-15 03:05:31,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:31,820 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,820 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:31,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1173670243, now seen corresponding path program 1 times [2019-10-15 03:05:31,821 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:31,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28615362] [2019-10-15 03:05:31,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:31,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:31,902 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,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28615362] [2019-10-15 03:05:31,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:31,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:31,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968957059] [2019-10-15 03:05:31,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:31,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:31,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:31,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:31,904 INFO L87 Difference]: Start difference. First operand 440 states and 505 transitions. Second operand 9 states. [2019-10-15 03:05:32,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:32,200 INFO L93 Difference]: Finished difference Result 442 states and 506 transitions. [2019-10-15 03:05:32,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:32,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-10-15 03:05:32,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:32,204 INFO L225 Difference]: With dead ends: 442 [2019-10-15 03:05:32,204 INFO L226 Difference]: Without dead ends: 325 [2019-10-15 03:05:32,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:32,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-15 03:05:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-10-15 03:05:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-10-15 03:05:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 377 transitions. [2019-10-15 03:05:32,249 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 377 transitions. Word has length 60 [2019-10-15 03:05:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:32,250 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 377 transitions. [2019-10-15 03:05:32,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 377 transitions. [2019-10-15 03:05:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-15 03:05:32,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:32,253 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] [2019-10-15 03:05:32,253 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1733141653, now seen corresponding path program 1 times [2019-10-15 03:05:32,254 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:32,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369654328] [2019-10-15 03:05:32,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:32,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369654328] [2019-10-15 03:05:32,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:32,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829159503] [2019-10-15 03:05:32,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:32,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:32,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:32,348 INFO L87 Difference]: Start difference. First operand 325 states and 377 transitions. Second operand 7 states. [2019-10-15 03:05:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:32,499 INFO L93 Difference]: Finished difference Result 342 states and 393 transitions. [2019-10-15 03:05:32,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 03:05:32,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-10-15 03:05:32,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:32,502 INFO L225 Difference]: With dead ends: 342 [2019-10-15 03:05:32,502 INFO L226 Difference]: Without dead ends: 323 [2019-10-15 03:05:32,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-15 03:05:32,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 284. [2019-10-15 03:05:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-15 03:05:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 325 transitions. [2019-10-15 03:05:32,538 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 325 transitions. Word has length 71 [2019-10-15 03:05:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:32,539 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 325 transitions. [2019-10-15 03:05:32,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 325 transitions. [2019-10-15 03:05:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:05:32,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:32,540 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] [2019-10-15 03:05:32,541 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:32,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:32,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1012836717, now seen corresponding path program 1 times [2019-10-15 03:05:32,541 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:32,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21564554] [2019-10-15 03:05:32,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:32,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:32,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21564554] [2019-10-15 03:05:32,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:32,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:32,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357255493] [2019-10-15 03:05:32,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:32,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:32,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:32,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:32,706 INFO L87 Difference]: Start difference. First operand 284 states and 325 transitions. Second operand 9 states. [2019-10-15 03:05:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:33,206 INFO L93 Difference]: Finished difference Result 400 states and 454 transitions. [2019-10-15 03:05:33,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:33,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-10-15 03:05:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:33,208 INFO L225 Difference]: With dead ends: 400 [2019-10-15 03:05:33,208 INFO L226 Difference]: Without dead ends: 256 [2019-10-15 03:05:33,209 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:33,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-15 03:05:33,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2019-10-15 03:05:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-15 03:05:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 286 transitions. [2019-10-15 03:05:33,234 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 286 transitions. Word has length 72 [2019-10-15 03:05:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:33,234 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 286 transitions. [2019-10-15 03:05:33,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:33,235 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 286 transitions. [2019-10-15 03:05:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 03:05:33,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:33,237 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] [2019-10-15 03:05:33,237 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash -392261068, now seen corresponding path program 1 times [2019-10-15 03:05:33,237 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:33,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840003521] [2019-10-15 03:05:33,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:33,357 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,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840003521] [2019-10-15 03:05:33,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:33,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 03:05:33,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656901861] [2019-10-15 03:05:33,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 03:05:33,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:33,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 03:05:33,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-15 03:05:33,359 INFO L87 Difference]: Start difference. First operand 252 states and 286 transitions. Second operand 10 states. [2019-10-15 03:05:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:33,774 INFO L93 Difference]: Finished difference Result 294 states and 325 transitions. [2019-10-15 03:05:33,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 03:05:33,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-15 03:05:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:33,777 INFO L225 Difference]: With dead ends: 294 [2019-10-15 03:05:33,778 INFO L226 Difference]: Without dead ends: 232 [2019-10-15 03:05:33,779 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-10-15 03:05:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-15 03:05:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-10-15 03:05:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-15 03:05:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 262 transitions. [2019-10-15 03:05:33,823 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 262 transitions. Word has length 78 [2019-10-15 03:05:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:33,823 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 262 transitions. [2019-10-15 03:05:33,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 03:05:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 262 transitions. [2019-10-15 03:05:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-15 03:05:33,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:33,826 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] [2019-10-15 03:05:33,827 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:33,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:33,827 INFO L82 PathProgramCache]: Analyzing trace with hash 220424145, now seen corresponding path program 1 times [2019-10-15 03:05:33,827 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:33,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283949107] [2019-10-15 03:05:33,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:33,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:34,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:05:34,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283949107] [2019-10-15 03:05:34,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:34,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:34,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910412528] [2019-10-15 03:05:34,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:34,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:34,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:34,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:34,017 INFO L87 Difference]: Start difference. First operand 232 states and 262 transitions. Second operand 11 states. [2019-10-15 03:05:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:34,142 INFO L93 Difference]: Finished difference Result 310 states and 347 transitions. [2019-10-15 03:05:34,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:34,142 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-10-15 03:05:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:34,144 INFO L225 Difference]: With dead ends: 310 [2019-10-15 03:05:34,144 INFO L226 Difference]: Without dead ends: 197 [2019-10-15 03:05:34,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:34,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-15 03:05:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2019-10-15 03:05:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-15 03:05:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 207 transitions. [2019-10-15 03:05:34,162 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 207 transitions. Word has length 83 [2019-10-15 03:05:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:34,163 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 207 transitions. [2019-10-15 03:05:34,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:34,163 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 207 transitions. [2019-10-15 03:05:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-15 03:05:34,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:34,164 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:34,165 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:34,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1811313841, now seen corresponding path program 1 times [2019-10-15 03:05:34,165 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:34,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122469827] [2019-10-15 03:05:34,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 03:05:34,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122469827] [2019-10-15 03:05:34,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:34,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:05:34,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13786946] [2019-10-15 03:05:34,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:05:34,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:34,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:05:34,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:05:34,275 INFO L87 Difference]: Start difference. First operand 189 states and 207 transitions. Second operand 7 states. [2019-10-15 03:05:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:34,611 INFO L93 Difference]: Finished difference Result 248 states and 279 transitions. [2019-10-15 03:05:34,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:05:34,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-10-15 03:05:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:34,613 INFO L225 Difference]: With dead ends: 248 [2019-10-15 03:05:34,613 INFO L226 Difference]: Without dead ends: 245 [2019-10-15 03:05:34,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:05:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-15 03:05:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 223. [2019-10-15 03:05:34,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-15 03:05:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2019-10-15 03:05:34,633 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 88 [2019-10-15 03:05:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:34,634 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2019-10-15 03:05:34,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:05:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2019-10-15 03:05:34,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-15 03:05:34,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:34,636 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:34,636 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:34,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1150229932, now seen corresponding path program 1 times [2019-10-15 03:05:34,637 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:34,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076046805] [2019-10-15 03:05:34,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:34,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:34,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076046805] [2019-10-15 03:05:34,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:34,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:34,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462044255] [2019-10-15 03:05:34,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:34,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:34,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:34,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:34,720 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand 5 states. [2019-10-15 03:05:35,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:35,033 INFO L93 Difference]: Finished difference Result 304 states and 334 transitions. [2019-10-15 03:05:35,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:05:35,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-10-15 03:05:35,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:35,036 INFO L225 Difference]: With dead ends: 304 [2019-10-15 03:05:35,036 INFO L226 Difference]: Without dead ends: 243 [2019-10-15 03:05:35,037 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:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-15 03:05:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 148. [2019-10-15 03:05:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-15 03:05:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2019-10-15 03:05:35,055 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 96 [2019-10-15 03:05:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:35,056 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2019-10-15 03:05:35,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2019-10-15 03:05:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 03:05:35,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:35,058 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:35,058 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:35,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:35,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1822011349, now seen corresponding path program 1 times [2019-10-15 03:05:35,058 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:35,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899394677] [2019-10-15 03:05:35,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,059 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:35,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899394677] [2019-10-15 03:05:35,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:35,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-15 03:05:35,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471012178] [2019-10-15 03:05:35,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-15 03:05:35,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:35,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-15 03:05:35,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-15 03:05:35,283 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand 13 states. [2019-10-15 03:05:35,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:35,764 INFO L93 Difference]: Finished difference Result 191 states and 210 transitions. [2019-10-15 03:05:35,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:05:35,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2019-10-15 03:05:35,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:35,766 INFO L225 Difference]: With dead ends: 191 [2019-10-15 03:05:35,766 INFO L226 Difference]: Without dead ends: 162 [2019-10-15 03:05:35,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-10-15 03:05:35,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-15 03:05:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2019-10-15 03:05:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-15 03:05:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2019-10-15 03:05:35,783 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 107 [2019-10-15 03:05:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:35,784 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2019-10-15 03:05:35,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-15 03:05:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2019-10-15 03:05:35,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 03:05:35,785 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:35,785 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:35,786 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:35,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:35,786 INFO L82 PathProgramCache]: Analyzing trace with hash -949307777, now seen corresponding path program 1 times [2019-10-15 03:05:35,786 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:35,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753527219] [2019-10-15 03:05:35,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,787 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:35,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:36,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753527219] [2019-10-15 03:05:36,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:36,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-15 03:05:36,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615242552] [2019-10-15 03:05:36,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 03:05:36,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:36,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 03:05:36,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:36,012 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 11 states. [2019-10-15 03:05:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:36,334 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2019-10-15 03:05:36,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:05:36,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 120 [2019-10-15 03:05:36,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:36,336 INFO L225 Difference]: With dead ends: 187 [2019-10-15 03:05:36,337 INFO L226 Difference]: Without dead ends: 154 [2019-10-15 03:05:36,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-15 03:05:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-15 03:05:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-10-15 03:05:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-15 03:05:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2019-10-15 03:05:36,355 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 120 [2019-10-15 03:05:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:36,356 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2019-10-15 03:05:36,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 03:05:36,356 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2019-10-15 03:05:36,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 03:05:36,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:36,358 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:36,358 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:36,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:36,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1669499445, now seen corresponding path program 1 times [2019-10-15 03:05:36,359 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:36,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059689290] [2019-10-15 03:05:36,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:36,483 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:36,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059689290] [2019-10-15 03:05:36,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:36,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:05:36,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453743402] [2019-10-15 03:05:36,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:05:36,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:36,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:05:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:05:36,485 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 5 states. [2019-10-15 03:05:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:36,654 INFO L93 Difference]: Finished difference Result 193 states and 200 transitions. [2019-10-15 03:05:36,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:05:36,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-10-15 03:05:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:36,655 INFO L225 Difference]: With dead ends: 193 [2019-10-15 03:05:36,655 INFO L226 Difference]: Without dead ends: 139 [2019-10-15 03:05:36,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:05:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-15 03:05:36,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-10-15 03:05:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-15 03:05:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2019-10-15 03:05:36,670 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 123 [2019-10-15 03:05:36,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:36,670 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2019-10-15 03:05:36,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:05:36,671 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2019-10-15 03:05:36,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 03:05:36,672 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:36,673 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:36,673 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:36,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1614696425, now seen corresponding path program 1 times [2019-10-15 03:05:36,674 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:36,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590341169] [2019-10-15 03:05:36,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:36,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 03:05:36,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590341169] [2019-10-15 03:05:36,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:36,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 03:05:36,863 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650049154] [2019-10-15 03:05:36,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 03:05:36,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:36,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 03:05:36,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 03:05:36,865 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 9 states. [2019-10-15 03:05:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:37,247 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2019-10-15 03:05:37,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:05:37,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-10-15 03:05:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:37,249 INFO L225 Difference]: With dead ends: 189 [2019-10-15 03:05:37,249 INFO L226 Difference]: Without dead ends: 138 [2019-10-15 03:05:37,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-15 03:05:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-15 03:05:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-10-15 03:05:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-15 03:05:37,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-10-15 03:05:37,264 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 125 [2019-10-15 03:05:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:37,265 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-10-15 03:05:37,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 03:05:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-10-15 03:05:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 03:05:37,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:05:37,267 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:05:37,267 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:05:37,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:05:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash 618335336, now seen corresponding path program 1 times [2019-10-15 03:05:37,268 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:05:37,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504772988] [2019-10-15 03:05:37,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:05:37,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:05:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:05:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-15 03:05:37,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504772988] [2019-10-15 03:05:37,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:05:37,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-15 03:05:37,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613782574] [2019-10-15 03:05:37,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-15 03:05:37,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:05:37,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-15 03:05:37,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:05:37,746 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 14 states. [2019-10-15 03:05:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:05:38,867 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2019-10-15 03:05:38,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 03:05:38,868 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 125 [2019-10-15 03:05:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:05:38,869 INFO L225 Difference]: With dead ends: 141 [2019-10-15 03:05:38,869 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:05:38,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2019-10-15 03:05:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:05:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:05:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:05:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:05:38,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2019-10-15 03:05:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:05:38,881 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:05:38,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-15 03:05:38,881 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:05:38,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:05:38,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:05:40,761 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-10-15 03:05:40,921 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-10-15 03:05:41,557 WARN L191 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 85 [2019-10-15 03:05:42,034 WARN L191 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 51 [2019-10-15 03:05:42,380 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-10-15 03:05:42,713 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 62 [2019-10-15 03:05:42,991 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-10-15 03:05:43,441 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2019-10-15 03:05:43,589 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 1 [2019-10-15 03:05:43,694 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-15 03:05:43,951 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-10-15 03:05:44,096 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-10-15 03:05:44,311 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-10-15 03:05:44,628 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2019-10-15 03:05:44,832 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-15 03:05:45,015 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 1 [2019-10-15 03:05:45,465 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2019-10-15 03:05:45,959 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 70 [2019-10-15 03:05:46,471 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2019-10-15 03:05:47,111 WARN L191 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 91 [2019-10-15 03:05:47,262 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-15 03:05:47,616 WARN L191 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-10-15 03:05:47,747 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-10-15 03:05:47,962 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 69 [2019-10-15 03:05:48,122 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-10-15 03:05:48,362 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-10-15 03:05:48,648 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-10-15 03:05:48,792 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66