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-f4eb214f-m [2019-10-13 23:01:14,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:01:14,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:01:14,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:01:14,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:01:14,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:01:14,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:01:14,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:01:14,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:01:14,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:01:14,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:01:14,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:01:14,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:01:14,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:01:14,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:01:14,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:01:14,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:01:14,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:01:14,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:01:14,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:01:14,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:01:14,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:01:14,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:01:14,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:01:14,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:01:14,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:01:14,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:01:14,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:01:14,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:01:14,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:01:14,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:01:14,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:01:14,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:01:14,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:01:14,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:01:14,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:01:14,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:01:14,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:01:14,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:01:14,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:01:14,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:01:14,205 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-13 23:01:14,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:01:14,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:01:14,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:01:14,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:01:14,221 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:01:14,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:01:14,221 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:01:14,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:01:14,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:01:14,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:01:14,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:01:14,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:01:14,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:01:14,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:01:14,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:01:14,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:01:14,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:01:14,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:01:14,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:01:14,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:01:14,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:01:14,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:01:14,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:01:14,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:01:14,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:01:14,225 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:01:14,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:01:14,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:01:14,225 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-13 23:01:14,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:01:14,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:01:14,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:01:14,527 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:01:14,527 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:01:14,528 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-13 23:01:14,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482fcdb5c/507d39af794647708658c0b17d2cac31/FLAGc42bdfdff [2019-10-13 23:01:15,118 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:01:15,118 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2019-10-13 23:01:15,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482fcdb5c/507d39af794647708658c0b17d2cac31/FLAGc42bdfdff [2019-10-13 23:01:15,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482fcdb5c/507d39af794647708658c0b17d2cac31 [2019-10-13 23:01:15,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:01:15,491 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:01:15,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:15,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:01:15,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:01:15,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:15" (1/1) ... [2019-10-13 23:01:15,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5097dd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:15, skipping insertion in model container [2019-10-13 23:01:15,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:01:15" (1/1) ... [2019-10-13 23:01:15,505 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:01:15,552 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:01:15,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:15,969 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:01:16,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:01:16,117 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:01:16,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:16 WrapperNode [2019-10-13 23:01:16,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:01:16,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:01:16,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:01:16,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:01:16,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:16" (1/1) ... [2019-10-13 23:01:16,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:16" (1/1) ... [2019-10-13 23:01:16,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:16" (1/1) ... [2019-10-13 23:01:16,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:16" (1/1) ... [2019-10-13 23:01:16,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:16" (1/1) ... [2019-10-13 23:01:16,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:16" (1/1) ... [2019-10-13 23:01:16,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:16" (1/1) ... [2019-10-13 23:01:16,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:01:16,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:01:16,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:01:16,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:01:16,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:16" (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-13 23:01:16,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:01:16,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:01:16,268 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-13 23:01:16,268 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-13 23:01:16,268 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-13 23:01:16,269 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-13 23:01:16,269 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-13 23:01:16,269 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-13 23:01:16,269 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-13 23:01:16,269 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-13 23:01:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-13 23:01:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-13 23:01:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:01:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-13 23:01:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-13 23:01:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-13 23:01:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-13 23:01:16,271 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-13 23:01:16,271 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-13 23:01:16,271 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-13 23:01:16,271 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-13 23:01:16,271 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-13 23:01:16,271 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-13 23:01:16,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-13 23:01:16,272 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-13 23:01:16,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-13 23:01:16,272 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-13 23:01:16,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:01:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:01:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:01:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 23:01:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 23:01:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-13 23:01:16,273 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-13 23:01:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-13 23:01:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-13 23:01:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-13 23:01:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-13 23:01:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-13 23:01:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-13 23:01:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-13 23:01:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-13 23:01:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-13 23:01:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-13 23:01:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-13 23:01:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-13 23:01:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-13 23:01:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-13 23:01:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-13 23:01:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-13 23:01:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-13 23:01:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-13 23:01:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-13 23:01:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-13 23:01:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:01:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-13 23:01:16,276 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-13 23:01:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:01:16,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:01:16,590 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:16,676 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:16,676 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:16,700 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:16,716 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:16,717 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:16,732 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:16,966 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-13 23:01:16,966 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-13 23:01:16,969 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:17,055 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2019-10-13 23:01:17,056 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2019-10-13 23:01:17,074 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:17,095 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-13 23:01:17,096 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-13 23:01:17,198 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:17,218 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:17,219 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:17,219 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:17,234 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:17,234 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:17,235 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:17,246 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:17,247 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:17,294 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:17,328 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-13 23:01:17,328 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-13 23:01:17,377 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:17,385 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:17,385 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:17,385 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:17,405 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:17,405 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:17,405 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 23:01:17,416 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 23:01:17,416 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 23:01:17,792 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:01:17,792 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 23:01:17,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:17 BoogieIcfgContainer [2019-10-13 23:01:17,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:01:17,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:01:17,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:01:17,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:01:17,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:01:15" (1/3) ... [2019-10-13 23:01:17,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125a5428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:17, skipping insertion in model container [2019-10-13 23:01:17,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:01:16" (2/3) ... [2019-10-13 23:01:17,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125a5428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:01:17, skipping insertion in model container [2019-10-13 23:01:17,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:01:17" (3/3) ... [2019-10-13 23:01:17,806 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2019-10-13 23:01:17,815 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:01:17,822 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:01:17,833 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:01:17,865 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:01:17,865 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:01:17,865 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:01:17,865 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:01:17,866 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:01:17,866 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:01:17,866 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:01:17,866 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:01:17,892 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states. [2019-10-13 23:01:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 23:01:17,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:17,901 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-13 23:01:17,903 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:17,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1497224750, now seen corresponding path program 1 times [2019-10-13 23:01:17,919 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:17,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747230835] [2019-10-13 23:01:17,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:17,920 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:17,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:18,212 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-13 23:01:18,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747230835] [2019-10-13 23:01:18,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:18,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:18,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121635928] [2019-10-13 23:01:18,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:18,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:18,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:18,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:18,236 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 3 states. [2019-10-13 23:01:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:18,326 INFO L93 Difference]: Finished difference Result 397 states and 575 transitions. [2019-10-13 23:01:18,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:18,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-13 23:01:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:18,344 INFO L225 Difference]: With dead ends: 397 [2019-10-13 23:01:18,344 INFO L226 Difference]: Without dead ends: 227 [2019-10-13 23:01:18,350 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-13 23:01:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-13 23:01:18,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-10-13 23:01:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-13 23:01:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 297 transitions. [2019-10-13 23:01:18,417 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 297 transitions. Word has length 18 [2019-10-13 23:01:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:18,417 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 297 transitions. [2019-10-13 23:01:18,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 297 transitions. [2019-10-13 23:01:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 23:01:18,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:18,419 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-13 23:01:18,420 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash -726168722, now seen corresponding path program 1 times [2019-10-13 23:01:18,421 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:18,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217497534] [2019-10-13 23:01:18,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:18,599 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-13 23:01:18,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217497534] [2019-10-13 23:01:18,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:18,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:18,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958664561] [2019-10-13 23:01:18,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:18,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:18,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:18,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:18,605 INFO L87 Difference]: Start difference. First operand 227 states and 297 transitions. Second operand 3 states. [2019-10-13 23:01:18,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:18,847 INFO L93 Difference]: Finished difference Result 416 states and 544 transitions. [2019-10-13 23:01:18,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:18,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-13 23:01:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:18,854 INFO L225 Difference]: With dead ends: 416 [2019-10-13 23:01:18,856 INFO L226 Difference]: Without dead ends: 292 [2019-10-13 23:01:18,858 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-13 23:01:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-13 23:01:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2019-10-13 23:01:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-13 23:01:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 373 transitions. [2019-10-13 23:01:18,933 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 373 transitions. Word has length 22 [2019-10-13 23:01:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:18,933 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 373 transitions. [2019-10-13 23:01:18,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:18,934 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 373 transitions. [2019-10-13 23:01:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 23:01:18,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:18,935 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-13 23:01:18,935 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:18,937 INFO L82 PathProgramCache]: Analyzing trace with hash -451141895, now seen corresponding path program 1 times [2019-10-13 23:01:18,937 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:18,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118259774] [2019-10-13 23:01:18,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:18,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:19,103 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-13 23:01:19,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118259774] [2019-10-13 23:01:19,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:19,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:19,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134657793] [2019-10-13 23:01:19,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:19,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:19,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:19,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:19,107 INFO L87 Difference]: Start difference. First operand 289 states and 373 transitions. Second operand 3 states. [2019-10-13 23:01:19,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:19,155 INFO L93 Difference]: Finished difference Result 605 states and 786 transitions. [2019-10-13 23:01:19,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:19,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 23:01:19,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:19,162 INFO L225 Difference]: With dead ends: 605 [2019-10-13 23:01:19,162 INFO L226 Difference]: Without dead ends: 443 [2019-10-13 23:01:19,163 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-13 23:01:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-13 23:01:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 415. [2019-10-13 23:01:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-10-13 23:01:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 542 transitions. [2019-10-13 23:01:19,217 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 542 transitions. Word has length 24 [2019-10-13 23:01:19,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:19,217 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 542 transitions. [2019-10-13 23:01:19,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 542 transitions. [2019-10-13 23:01:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:01:19,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:19,220 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-13 23:01:19,221 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:19,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:19,221 INFO L82 PathProgramCache]: Analyzing trace with hash -59603234, now seen corresponding path program 1 times [2019-10-13 23:01:19,221 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:19,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215408766] [2019-10-13 23:01:19,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:19,311 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-13 23:01:19,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215408766] [2019-10-13 23:01:19,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:19,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:19,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578217455] [2019-10-13 23:01:19,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:19,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:19,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:19,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:19,314 INFO L87 Difference]: Start difference. First operand 415 states and 542 transitions. Second operand 3 states. [2019-10-13 23:01:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:19,362 INFO L93 Difference]: Finished difference Result 484 states and 628 transitions. [2019-10-13 23:01:19,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:19,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 23:01:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:19,376 INFO L225 Difference]: With dead ends: 484 [2019-10-13 23:01:19,378 INFO L226 Difference]: Without dead ends: 466 [2019-10-13 23:01:19,379 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-13 23:01:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-13 23:01:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 450. [2019-10-13 23:01:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-13 23:01:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 584 transitions. [2019-10-13 23:01:19,418 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 584 transitions. Word has length 28 [2019-10-13 23:01:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:19,419 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 584 transitions. [2019-10-13 23:01:19,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 584 transitions. [2019-10-13 23:01:19,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 23:01:19,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:19,421 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-13 23:01:19,422 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:19,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:19,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1687296961, now seen corresponding path program 1 times [2019-10-13 23:01:19,422 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:19,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928514404] [2019-10-13 23:01:19,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:19,500 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-13 23:01:19,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928514404] [2019-10-13 23:01:19,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:19,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:19,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632248476] [2019-10-13 23:01:19,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:19,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:19,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:19,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:19,503 INFO L87 Difference]: Start difference. First operand 450 states and 584 transitions. Second operand 3 states. [2019-10-13 23:01:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:19,606 INFO L93 Difference]: Finished difference Result 459 states and 595 transitions. [2019-10-13 23:01:19,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:19,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 23:01:19,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:19,611 INFO L225 Difference]: With dead ends: 459 [2019-10-13 23:01:19,611 INFO L226 Difference]: Without dead ends: 456 [2019-10-13 23:01:19,612 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-13 23:01:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-13 23:01:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2019-10-13 23:01:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-13 23:01:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 591 transitions. [2019-10-13 23:01:19,641 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 591 transitions. Word has length 32 [2019-10-13 23:01:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:19,641 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 591 transitions. [2019-10-13 23:01:19,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 591 transitions. [2019-10-13 23:01:19,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 23:01:19,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:19,644 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-13 23:01:19,644 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:19,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:19,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1068938519, now seen corresponding path program 1 times [2019-10-13 23:01:19,645 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:19,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525465116] [2019-10-13 23:01:19,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:19,694 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-13 23:01:19,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525465116] [2019-10-13 23:01:19,696 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:19,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:19,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468930046] [2019-10-13 23:01:19,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:19,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:19,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:19,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:19,698 INFO L87 Difference]: Start difference. First operand 456 states and 591 transitions. Second operand 3 states. [2019-10-13 23:01:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:19,820 INFO L93 Difference]: Finished difference Result 605 states and 798 transitions. [2019-10-13 23:01:19,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:19,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 23:01:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:19,829 INFO L225 Difference]: With dead ends: 605 [2019-10-13 23:01:19,830 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 23:01:19,831 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-13 23:01:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 23:01:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 502. [2019-10-13 23:01:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-13 23:01:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 655 transitions. [2019-10-13 23:01:19,878 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 655 transitions. Word has length 35 [2019-10-13 23:01:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:19,879 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 655 transitions. [2019-10-13 23:01:19,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 655 transitions. [2019-10-13 23:01:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 23:01:19,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:19,883 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-13 23:01:19,883 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:19,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:19,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1155855189, now seen corresponding path program 1 times [2019-10-13 23:01:19,884 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:19,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669422741] [2019-10-13 23:01:19,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:19,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:19,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669422741] [2019-10-13 23:01:19,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:19,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:19,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784383998] [2019-10-13 23:01:19,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:19,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:19,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:19,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:19,945 INFO L87 Difference]: Start difference. First operand 502 states and 655 transitions. Second operand 3 states. [2019-10-13 23:01:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:20,073 INFO L93 Difference]: Finished difference Result 530 states and 687 transitions. [2019-10-13 23:01:20,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:20,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 23:01:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:20,078 INFO L225 Difference]: With dead ends: 530 [2019-10-13 23:01:20,078 INFO L226 Difference]: Without dead ends: 525 [2019-10-13 23:01:20,079 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-13 23:01:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-10-13 23:01:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 523. [2019-10-13 23:01:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-13 23:01:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 680 transitions. [2019-10-13 23:01:20,115 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 680 transitions. Word has length 35 [2019-10-13 23:01:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:20,117 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 680 transitions. [2019-10-13 23:01:20,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 680 transitions. [2019-10-13 23:01:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 23:01:20,123 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:20,123 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-13 23:01:20,123 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 984815367, now seen corresponding path program 1 times [2019-10-13 23:01:20,124 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:20,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137895974] [2019-10-13 23:01:20,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:20,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:20,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-13 23:01:20,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137895974] [2019-10-13 23:01:20,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:20,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:20,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673695967] [2019-10-13 23:01:20,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:20,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:20,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:20,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:20,249 INFO L87 Difference]: Start difference. First operand 523 states and 680 transitions. Second operand 8 states. [2019-10-13 23:01:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:20,987 INFO L93 Difference]: Finished difference Result 689 states and 894 transitions. [2019-10-13 23:01:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:20,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-10-13 23:01:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:20,992 INFO L225 Difference]: With dead ends: 689 [2019-10-13 23:01:20,992 INFO L226 Difference]: Without dead ends: 620 [2019-10-13 23:01:20,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-13 23:01:21,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 517. [2019-10-13 23:01:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-10-13 23:01:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 666 transitions. [2019-10-13 23:01:21,026 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 666 transitions. Word has length 36 [2019-10-13 23:01:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,026 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 666 transitions. [2019-10-13 23:01:21,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 666 transitions. [2019-10-13 23:01:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 23:01:21,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,028 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-13 23:01:21,028 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1019894896, now seen corresponding path program 1 times [2019-10-13 23:01:21,029 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252680413] [2019-10-13 23:01:21,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,130 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-13 23:01:21,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252680413] [2019-10-13 23:01:21,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:21,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014611454] [2019-10-13 23:01:21,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:21,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:21,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:21,133 INFO L87 Difference]: Start difference. First operand 517 states and 666 transitions. Second operand 8 states. [2019-10-13 23:01:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:21,667 INFO L93 Difference]: Finished difference Result 539 states and 688 transitions. [2019-10-13 23:01:21,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:21,668 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-10-13 23:01:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:21,671 INFO L225 Difference]: With dead ends: 539 [2019-10-13 23:01:21,672 INFO L226 Difference]: Without dead ends: 533 [2019-10-13 23:01:21,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:21,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-13 23:01:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 517. [2019-10-13 23:01:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-10-13 23:01:21,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 665 transitions. [2019-10-13 23:01:21,711 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 665 transitions. Word has length 36 [2019-10-13 23:01:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:21,711 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 665 transitions. [2019-10-13 23:01:21,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 665 transitions. [2019-10-13 23:01:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 23:01:21,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:21,713 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-13 23:01:21,713 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1882604984, now seen corresponding path program 1 times [2019-10-13 23:01:21,714 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:21,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931999006] [2019-10-13 23:01:21,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:21,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:21,786 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-13 23:01:21,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931999006] [2019-10-13 23:01:21,787 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:21,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:21,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556009628] [2019-10-13 23:01:21,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:21,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:21,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:21,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:21,789 INFO L87 Difference]: Start difference. First operand 517 states and 665 transitions. Second operand 8 states. [2019-10-13 23:01:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,412 INFO L93 Difference]: Finished difference Result 539 states and 686 transitions. [2019-10-13 23:01:22,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:22,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-10-13 23:01:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,417 INFO L225 Difference]: With dead ends: 539 [2019-10-13 23:01:22,418 INFO L226 Difference]: Without dead ends: 533 [2019-10-13 23:01:22,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:01:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-13 23:01:22,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 517. [2019-10-13 23:01:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-10-13 23:01:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 664 transitions. [2019-10-13 23:01:22,456 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 664 transitions. Word has length 37 [2019-10-13 23:01:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,456 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 664 transitions. [2019-10-13 23:01:22,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:22,457 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 664 transitions. [2019-10-13 23:01:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 23:01:22,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,458 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-13 23:01:22,458 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1685011911, now seen corresponding path program 1 times [2019-10-13 23:01:22,459 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450273303] [2019-10-13 23:01:22,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,537 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-13 23:01:22,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450273303] [2019-10-13 23:01:22,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:22,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141660842] [2019-10-13 23:01:22,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:22,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:22,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:22,541 INFO L87 Difference]: Start difference. First operand 517 states and 664 transitions. Second operand 5 states. [2019-10-13 23:01:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,581 INFO L93 Difference]: Finished difference Result 533 states and 679 transitions. [2019-10-13 23:01:22,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:22,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-13 23:01:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,585 INFO L225 Difference]: With dead ends: 533 [2019-10-13 23:01:22,585 INFO L226 Difference]: Without dead ends: 515 [2019-10-13 23:01:22,586 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-13 23:01:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-10-13 23:01:22,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2019-10-13 23:01:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2019-10-13 23:01:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 660 transitions. [2019-10-13 23:01:22,621 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 660 transitions. Word has length 38 [2019-10-13 23:01:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,621 INFO L462 AbstractCegarLoop]: Abstraction has 515 states and 660 transitions. [2019-10-13 23:01:22,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 660 transitions. [2019-10-13 23:01:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 23:01:22,623 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,623 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-13 23:01:22,623 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash 772670357, now seen corresponding path program 1 times [2019-10-13 23:01:22,624 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610971914] [2019-10-13 23:01:22,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,686 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-13 23:01:22,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610971914] [2019-10-13 23:01:22,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:01:22,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186677374] [2019-10-13 23:01:22,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:01:22,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:01:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:01:22,688 INFO L87 Difference]: Start difference. First operand 515 states and 660 transitions. Second operand 4 states. [2019-10-13 23:01:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:22,842 INFO L93 Difference]: Finished difference Result 565 states and 704 transitions. [2019-10-13 23:01:22,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:01:22,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-10-13 23:01:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:22,845 INFO L225 Difference]: With dead ends: 565 [2019-10-13 23:01:22,845 INFO L226 Difference]: Without dead ends: 376 [2019-10-13 23:01:22,846 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-13 23:01:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-13 23:01:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 357. [2019-10-13 23:01:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-13 23:01:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 436 transitions. [2019-10-13 23:01:22,892 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 436 transitions. Word has length 40 [2019-10-13 23:01:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:22,892 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 436 transitions. [2019-10-13 23:01:22,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:01:22,893 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 436 transitions. [2019-10-13 23:01:22,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:01:22,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:22,894 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-13 23:01:22,894 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:22,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1299782882, now seen corresponding path program 1 times [2019-10-13 23:01:22,895 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:22,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91535721] [2019-10-13 23:01:22,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:22,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:22,958 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-13 23:01:22,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91535721] [2019-10-13 23:01:22,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:22,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:22,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209603929] [2019-10-13 23:01:22,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:22,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:22,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:22,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:22,960 INFO L87 Difference]: Start difference. First operand 357 states and 436 transitions. Second operand 3 states. [2019-10-13 23:01:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,028 INFO L93 Difference]: Finished difference Result 538 states and 668 transitions. [2019-10-13 23:01:23,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:23,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-13 23:01:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,031 INFO L225 Difference]: With dead ends: 538 [2019-10-13 23:01:23,032 INFO L226 Difference]: Without dead ends: 360 [2019-10-13 23:01:23,033 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-13 23:01:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-10-13 23:01:23,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2019-10-13 23:01:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-13 23:01:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 440 transitions. [2019-10-13 23:01:23,056 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 440 transitions. Word has length 48 [2019-10-13 23:01:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,057 INFO L462 AbstractCegarLoop]: Abstraction has 360 states and 440 transitions. [2019-10-13 23:01:23,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 440 transitions. [2019-10-13 23:01:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:01:23,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,059 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-13 23:01:23,059 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1887771739, now seen corresponding path program 1 times [2019-10-13 23:01:23,060 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723384647] [2019-10-13 23:01:23,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,226 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-13 23:01:23,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723384647] [2019-10-13 23:01:23,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:23,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813340423] [2019-10-13 23:01:23,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:23,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:23,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:23,228 INFO L87 Difference]: Start difference. First operand 360 states and 440 transitions. Second operand 5 states. [2019-10-13 23:01:23,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,263 INFO L93 Difference]: Finished difference Result 534 states and 661 transitions. [2019-10-13 23:01:23,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:23,264 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-13 23:01:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,266 INFO L225 Difference]: With dead ends: 534 [2019-10-13 23:01:23,266 INFO L226 Difference]: Without dead ends: 353 [2019-10-13 23:01:23,267 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-13 23:01:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-10-13 23:01:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2019-10-13 23:01:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-10-13 23:01:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 428 transitions. [2019-10-13 23:01:23,291 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 428 transitions. Word has length 50 [2019-10-13 23:01:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,292 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 428 transitions. [2019-10-13 23:01:23,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 428 transitions. [2019-10-13 23:01:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 23:01:23,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,293 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-13 23:01:23,293 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,294 INFO L82 PathProgramCache]: Analyzing trace with hash -445964506, now seen corresponding path program 1 times [2019-10-13 23:01:23,294 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861019951] [2019-10-13 23:01:23,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,294 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:23,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861019951] [2019-10-13 23:01:23,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:23,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190298052] [2019-10-13 23:01:23,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:23,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:23,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:23,331 INFO L87 Difference]: Start difference. First operand 353 states and 428 transitions. Second operand 3 states. [2019-10-13 23:01:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:23,427 INFO L93 Difference]: Finished difference Result 493 states and 614 transitions. [2019-10-13 23:01:23,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:23,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 23:01:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:23,430 INFO L225 Difference]: With dead ends: 493 [2019-10-13 23:01:23,431 INFO L226 Difference]: Without dead ends: 485 [2019-10-13 23:01:23,431 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-13 23:01:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-13 23:01:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 393. [2019-10-13 23:01:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-10-13 23:01:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 478 transitions. [2019-10-13 23:01:23,459 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 478 transitions. Word has length 43 [2019-10-13 23:01:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:23,460 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 478 transitions. [2019-10-13 23:01:23,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 478 transitions. [2019-10-13 23:01:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:01:23,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:23,461 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-13 23:01:23,462 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:23,462 INFO L82 PathProgramCache]: Analyzing trace with hash -488120203, now seen corresponding path program 1 times [2019-10-13 23:01:23,462 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:23,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197221491] [2019-10-13 23:01:23,462 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,463 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:23,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:23,572 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-13 23:01:23,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197221491] [2019-10-13 23:01:23,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:23,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:23,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293290292] [2019-10-13 23:01:23,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:23,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:23,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:23,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:23,576 INFO L87 Difference]: Start difference. First operand 393 states and 478 transitions. Second operand 10 states. [2019-10-13 23:01:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:24,952 INFO L93 Difference]: Finished difference Result 439 states and 530 transitions. [2019-10-13 23:01:24,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:01:24,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-10-13 23:01:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:24,955 INFO L225 Difference]: With dead ends: 439 [2019-10-13 23:01:24,955 INFO L226 Difference]: Without dead ends: 435 [2019-10-13 23:01:24,956 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-13 23:01:24,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-13 23:01:24,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2019-10-13 23:01:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-10-13 23:01:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 523 transitions. [2019-10-13 23:01:24,991 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 523 transitions. Word has length 44 [2019-10-13 23:01:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:24,991 INFO L462 AbstractCegarLoop]: Abstraction has 431 states and 523 transitions. [2019-10-13 23:01:24,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 523 transitions. [2019-10-13 23:01:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:01:24,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:24,993 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-13 23:01:24,993 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash -487843373, now seen corresponding path program 1 times [2019-10-13 23:01:24,994 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:24,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151213992] [2019-10-13 23:01:24,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:24,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,058 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-13 23:01:25,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151213992] [2019-10-13 23:01:25,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:25,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106754685] [2019-10-13 23:01:25,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:25,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:25,060 INFO L87 Difference]: Start difference. First operand 431 states and 523 transitions. Second operand 8 states. [2019-10-13 23:01:25,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,213 INFO L93 Difference]: Finished difference Result 463 states and 559 transitions. [2019-10-13 23:01:25,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:25,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-13 23:01:25,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,217 INFO L225 Difference]: With dead ends: 463 [2019-10-13 23:01:25,217 INFO L226 Difference]: Without dead ends: 447 [2019-10-13 23:01:25,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:25,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-13 23:01:25,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 439. [2019-10-13 23:01:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-13 23:01:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 532 transitions. [2019-10-13 23:01:25,246 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 532 transitions. Word has length 44 [2019-10-13 23:01:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,246 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 532 transitions. [2019-10-13 23:01:25,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 532 transitions. [2019-10-13 23:01:25,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:01:25,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,248 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-13 23:01:25,248 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1717538634, now seen corresponding path program 1 times [2019-10-13 23:01:25,248 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995546359] [2019-10-13 23:01:25,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,313 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-13 23:01:25,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995546359] [2019-10-13 23:01:25,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:25,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353891607] [2019-10-13 23:01:25,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:25,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:25,315 INFO L87 Difference]: Start difference. First operand 439 states and 532 transitions. Second operand 7 states. [2019-10-13 23:01:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:25,864 INFO L93 Difference]: Finished difference Result 500 states and 609 transitions. [2019-10-13 23:01:25,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:25,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-10-13 23:01:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:25,867 INFO L225 Difference]: With dead ends: 500 [2019-10-13 23:01:25,867 INFO L226 Difference]: Without dead ends: 439 [2019-10-13 23:01:25,868 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-13 23:01:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-10-13 23:01:25,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2019-10-13 23:01:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-13 23:01:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 530 transitions. [2019-10-13 23:01:25,897 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 530 transitions. Word has length 44 [2019-10-13 23:01:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:25,898 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 530 transitions. [2019-10-13 23:01:25,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 530 transitions. [2019-10-13 23:01:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 23:01:25,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:25,900 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-13 23:01:25,900 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:25,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash 462464929, now seen corresponding path program 1 times [2019-10-13 23:01:25,900 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:25,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094034136] [2019-10-13 23:01:25,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,901 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:25,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:25,937 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-13 23:01:25,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094034136] [2019-10-13 23:01:25,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:25,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:25,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148328191] [2019-10-13 23:01:25,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:25,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:25,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:25,940 INFO L87 Difference]: Start difference. First operand 439 states and 530 transitions. Second operand 3 states. [2019-10-13 23:01:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,016 INFO L93 Difference]: Finished difference Result 461 states and 552 transitions. [2019-10-13 23:01:26,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:26,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-13 23:01:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,020 INFO L225 Difference]: With dead ends: 461 [2019-10-13 23:01:26,020 INFO L226 Difference]: Without dead ends: 447 [2019-10-13 23:01:26,020 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-13 23:01:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-13 23:01:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 435. [2019-10-13 23:01:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-13 23:01:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 521 transitions. [2019-10-13 23:01:26,056 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 521 transitions. Word has length 45 [2019-10-13 23:01:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,057 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 521 transitions. [2019-10-13 23:01:26,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 521 transitions. [2019-10-13 23:01:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:01:26,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,060 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-13 23:01:26,060 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1389938668, now seen corresponding path program 1 times [2019-10-13 23:01:26,061 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361137866] [2019-10-13 23:01:26,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:26,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361137866] [2019-10-13 23:01:26,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:26,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761223718] [2019-10-13 23:01:26,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:26,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:26,135 INFO L87 Difference]: Start difference. First operand 435 states and 521 transitions. Second operand 5 states. [2019-10-13 23:01:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,430 INFO L93 Difference]: Finished difference Result 613 states and 744 transitions. [2019-10-13 23:01:26,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:26,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-13 23:01:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,434 INFO L225 Difference]: With dead ends: 613 [2019-10-13 23:01:26,434 INFO L226 Difference]: Without dead ends: 435 [2019-10-13 23:01:26,435 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-13 23:01:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-10-13 23:01:26,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2019-10-13 23:01:26,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-10-13 23:01:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 520 transitions. [2019-10-13 23:01:26,466 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 520 transitions. Word has length 54 [2019-10-13 23:01:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,466 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 520 transitions. [2019-10-13 23:01:26,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 520 transitions. [2019-10-13 23:01:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 23:01:26,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:01:26,468 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1903388506, now seen corresponding path program 1 times [2019-10-13 23:01:26,469 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453511633] [2019-10-13 23:01:26,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,519 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-13 23:01:26,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453511633] [2019-10-13 23:01:26,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:26,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823438803] [2019-10-13 23:01:26,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:26,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:26,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:26,521 INFO L87 Difference]: Start difference. First operand 435 states and 520 transitions. Second operand 5 states. [2019-10-13 23:01:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:26,854 INFO L93 Difference]: Finished difference Result 449 states and 533 transitions. [2019-10-13 23:01:26,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:26,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-13 23:01:26,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:26,858 INFO L225 Difference]: With dead ends: 449 [2019-10-13 23:01:26,858 INFO L226 Difference]: Without dead ends: 431 [2019-10-13 23:01:26,858 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-13 23:01:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-13 23:01:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2019-10-13 23:01:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-13 23:01:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 506 transitions. [2019-10-13 23:01:26,889 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 506 transitions. Word has length 46 [2019-10-13 23:01:26,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:26,889 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 506 transitions. [2019-10-13 23:01:26,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 506 transitions. [2019-10-13 23:01:26,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:01:26,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:26,892 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-13 23:01:26,892 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash -234491934, now seen corresponding path program 1 times [2019-10-13 23:01:26,893 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:26,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106835289] [2019-10-13 23:01:26,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:26,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:26,973 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-13 23:01:26,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106835289] [2019-10-13 23:01:26,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:26,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:26,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869655391] [2019-10-13 23:01:26,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:26,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:26,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:26,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:26,976 INFO L87 Difference]: Start difference. First operand 423 states and 506 transitions. Second operand 7 states. [2019-10-13 23:01:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:27,282 INFO L93 Difference]: Finished difference Result 430 states and 514 transitions. [2019-10-13 23:01:27,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:27,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-13 23:01:27,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:27,287 INFO L225 Difference]: With dead ends: 430 [2019-10-13 23:01:27,287 INFO L226 Difference]: Without dead ends: 427 [2019-10-13 23:01:27,287 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-13 23:01:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-10-13 23:01:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 423. [2019-10-13 23:01:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-10-13 23:01:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 506 transitions. [2019-10-13 23:01:27,313 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 506 transitions. Word has length 55 [2019-10-13 23:01:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:27,313 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 506 transitions. [2019-10-13 23:01:27,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 506 transitions. [2019-10-13 23:01:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:01:27,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:27,315 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-13 23:01:27,315 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:27,316 INFO L82 PathProgramCache]: Analyzing trace with hash 163990782, now seen corresponding path program 1 times [2019-10-13 23:01:27,316 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:27,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509652731] [2019-10-13 23:01:27,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:27,390 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-13 23:01:27,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509652731] [2019-10-13 23:01:27,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:27,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:27,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216478204] [2019-10-13 23:01:27,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:27,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:27,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:27,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:27,392 INFO L87 Difference]: Start difference. First operand 423 states and 506 transitions. Second operand 9 states. [2019-10-13 23:01:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:27,589 INFO L93 Difference]: Finished difference Result 448 states and 531 transitions. [2019-10-13 23:01:27,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:27,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-10-13 23:01:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:27,592 INFO L225 Difference]: With dead ends: 448 [2019-10-13 23:01:27,593 INFO L226 Difference]: Without dead ends: 418 [2019-10-13 23:01:27,593 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-13 23:01:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-13 23:01:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2019-10-13 23:01:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-10-13 23:01:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 498 transitions. [2019-10-13 23:01:27,627 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 498 transitions. Word has length 47 [2019-10-13 23:01:27,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:27,628 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 498 transitions. [2019-10-13 23:01:27,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 498 transitions. [2019-10-13 23:01:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:01:27,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:27,630 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-13 23:01:27,630 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:27,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:27,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1254376986, now seen corresponding path program 1 times [2019-10-13 23:01:27,631 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:27,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473470731] [2019-10-13 23:01:27,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:27,718 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-13 23:01:27,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473470731] [2019-10-13 23:01:27,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:27,719 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:27,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181878382] [2019-10-13 23:01:27,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:27,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:27,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:27,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:27,720 INFO L87 Difference]: Start difference. First operand 418 states and 498 transitions. Second operand 9 states. [2019-10-13 23:01:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:27,926 INFO L93 Difference]: Finished difference Result 443 states and 523 transitions. [2019-10-13 23:01:27,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:27,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-10-13 23:01:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:27,929 INFO L225 Difference]: With dead ends: 443 [2019-10-13 23:01:27,929 INFO L226 Difference]: Without dead ends: 413 [2019-10-13 23:01:27,929 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-13 23:01:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-13 23:01:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2019-10-13 23:01:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-10-13 23:01:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 490 transitions. [2019-10-13 23:01:27,956 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 490 transitions. Word has length 47 [2019-10-13 23:01:27,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:27,957 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 490 transitions. [2019-10-13 23:01:27,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 490 transitions. [2019-10-13 23:01:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 23:01:27,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:27,958 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-13 23:01:27,959 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:27,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:27,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1889673940, now seen corresponding path program 1 times [2019-10-13 23:01:27,959 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:27,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715517407] [2019-10-13 23:01:27,959 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,960 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:27,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,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-13 23:01:28,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715517407] [2019-10-13 23:01:28,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:01:28,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953484023] [2019-10-13 23:01:28,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:01:28,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:01:28,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:01:28,016 INFO L87 Difference]: Start difference. First operand 413 states and 490 transitions. Second operand 6 states. [2019-10-13 23:01:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:28,087 INFO L93 Difference]: Finished difference Result 430 states and 506 transitions. [2019-10-13 23:01:28,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:28,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-10-13 23:01:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:28,090 INFO L225 Difference]: With dead ends: 430 [2019-10-13 23:01:28,090 INFO L226 Difference]: Without dead ends: 395 [2019-10-13 23:01:28,090 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-13 23:01:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-13 23:01:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2019-10-13 23:01:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-13 23:01:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 468 transitions. [2019-10-13 23:01:28,116 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 468 transitions. Word has length 49 [2019-10-13 23:01:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,116 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 468 transitions. [2019-10-13 23:01:28,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:01:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 468 transitions. [2019-10-13 23:01:28,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:01:28,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,118 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-13 23:01:28,118 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1075527803, now seen corresponding path program 1 times [2019-10-13 23:01:28,119 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234481952] [2019-10-13 23:01:28,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,180 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-13 23:01:28,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234481952] [2019-10-13 23:01:28,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:28,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041821867] [2019-10-13 23:01:28,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:28,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:28,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:28,182 INFO L87 Difference]: Start difference. First operand 395 states and 468 transitions. Second operand 9 states. [2019-10-13 23:01:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:28,351 INFO L93 Difference]: Finished difference Result 420 states and 493 transitions. [2019-10-13 23:01:28,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:28,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-10-13 23:01:28,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:28,354 INFO L225 Difference]: With dead ends: 420 [2019-10-13 23:01:28,354 INFO L226 Difference]: Without dead ends: 390 [2019-10-13 23:01:28,354 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-13 23:01:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-10-13 23:01:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2019-10-13 23:01:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-10-13 23:01:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 460 transitions. [2019-10-13 23:01:28,378 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 460 transitions. Word has length 48 [2019-10-13 23:01:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,378 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 460 transitions. [2019-10-13 23:01:28,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 460 transitions. [2019-10-13 23:01:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:01:28,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,380 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-13 23:01:28,380 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1669746933, now seen corresponding path program 1 times [2019-10-13 23:01:28,381 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155285122] [2019-10-13 23:01:28,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,429 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-13 23:01:28,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155285122] [2019-10-13 23:01:28,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:01:28,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697039152] [2019-10-13 23:01:28,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:01:28,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:01:28,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:01:28,431 INFO L87 Difference]: Start difference. First operand 390 states and 460 transitions. Second operand 3 states. [2019-10-13 23:01:28,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:28,464 INFO L93 Difference]: Finished difference Result 639 states and 766 transitions. [2019-10-13 23:01:28,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:01:28,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 23:01:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:28,467 INFO L225 Difference]: With dead ends: 639 [2019-10-13 23:01:28,468 INFO L226 Difference]: Without dead ends: 467 [2019-10-13 23:01:28,469 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-13 23:01:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-13 23:01:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 440. [2019-10-13 23:01:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-13 23:01:28,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 522 transitions. [2019-10-13 23:01:28,497 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 522 transitions. Word has length 57 [2019-10-13 23:01:28,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,497 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 522 transitions. [2019-10-13 23:01:28,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:01:28,497 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 522 transitions. [2019-10-13 23:01:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:01:28,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,499 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-13 23:01:28,499 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1369679451, now seen corresponding path program 1 times [2019-10-13 23:01:28,499 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328570072] [2019-10-13 23:01:28,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,580 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-13 23:01:28,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328570072] [2019-10-13 23:01:28,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:28,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620786929] [2019-10-13 23:01:28,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:28,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:28,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:28,582 INFO L87 Difference]: Start difference. First operand 440 states and 522 transitions. Second operand 9 states. [2019-10-13 23:01:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:28,753 INFO L93 Difference]: Finished difference Result 465 states and 547 transitions. [2019-10-13 23:01:28,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:28,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-10-13 23:01:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:28,755 INFO L225 Difference]: With dead ends: 465 [2019-10-13 23:01:28,755 INFO L226 Difference]: Without dead ends: 411 [2019-10-13 23:01:28,756 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-13 23:01:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-13 23:01:28,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2019-10-13 23:01:28,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-13 23:01:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 486 transitions. [2019-10-13 23:01:28,782 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 486 transitions. Word has length 51 [2019-10-13 23:01:28,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:28,782 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 486 transitions. [2019-10-13 23:01:28,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 486 transitions. [2019-10-13 23:01:28,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 23:01:28,784 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:28,784 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-13 23:01:28,784 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:28,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:28,784 INFO L82 PathProgramCache]: Analyzing trace with hash -685045101, now seen corresponding path program 1 times [2019-10-13 23:01:28,785 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:28,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649788369] [2019-10-13 23:01:28,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:28,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:01:28,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649788369] [2019-10-13 23:01:28,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:28,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:28,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600845372] [2019-10-13 23:01:28,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:28,900 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:28,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:28,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:28,901 INFO L87 Difference]: Start difference. First operand 411 states and 486 transitions. Second operand 9 states. [2019-10-13 23:01:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:29,624 INFO L93 Difference]: Finished difference Result 445 states and 520 transitions. [2019-10-13 23:01:29,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:29,625 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-13 23:01:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:29,628 INFO L225 Difference]: With dead ends: 445 [2019-10-13 23:01:29,628 INFO L226 Difference]: Without dead ends: 409 [2019-10-13 23:01:29,630 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-13 23:01:29,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-13 23:01:29,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-13 23:01:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-13 23:01:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 481 transitions. [2019-10-13 23:01:29,667 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 481 transitions. Word has length 63 [2019-10-13 23:01:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:29,667 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 481 transitions. [2019-10-13 23:01:29,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 481 transitions. [2019-10-13 23:01:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 23:01:29,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:29,670 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-13 23:01:29,670 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1281989941, now seen corresponding path program 1 times [2019-10-13 23:01:29,670 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:29,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470241624] [2019-10-13 23:01:29,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:29,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:29,781 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-13 23:01:29,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470241624] [2019-10-13 23:01:29,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:29,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:01:29,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126805885] [2019-10-13 23:01:29,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:01:29,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:29,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:01:29,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:01:29,783 INFO L87 Difference]: Start difference. First operand 409 states and 481 transitions. Second operand 8 states. [2019-10-13 23:01:30,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,330 INFO L93 Difference]: Finished difference Result 491 states and 590 transitions. [2019-10-13 23:01:30,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:30,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-10-13 23:01:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,335 INFO L225 Difference]: With dead ends: 491 [2019-10-13 23:01:30,335 INFO L226 Difference]: Without dead ends: 487 [2019-10-13 23:01:30,336 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-13 23:01:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-10-13 23:01:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 409. [2019-10-13 23:01:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-13 23:01:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 481 transitions. [2019-10-13 23:01:30,375 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 481 transitions. Word has length 64 [2019-10-13 23:01:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,375 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 481 transitions. [2019-10-13 23:01:30,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:01:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 481 transitions. [2019-10-13 23:01:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:01:30,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,378 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-13 23:01:30,378 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1003050700, now seen corresponding path program 1 times [2019-10-13 23:01:30,379 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537307558] [2019-10-13 23:01:30,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,447 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-13 23:01:30,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537307558] [2019-10-13 23:01:30,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:30,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279338503] [2019-10-13 23:01:30,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:30,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:30,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:30,450 INFO L87 Difference]: Start difference. First operand 409 states and 481 transitions. Second operand 5 states. [2019-10-13 23:01:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:30,871 INFO L93 Difference]: Finished difference Result 713 states and 815 transitions. [2019-10-13 23:01:30,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:01:30,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-13 23:01:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:30,874 INFO L225 Difference]: With dead ends: 713 [2019-10-13 23:01:30,874 INFO L226 Difference]: Without dead ends: 460 [2019-10-13 23:01:30,875 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-13 23:01:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-10-13 23:01:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 440. [2019-10-13 23:01:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-10-13 23:01:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 505 transitions. [2019-10-13 23:01:30,908 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 505 transitions. Word has length 59 [2019-10-13 23:01:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:30,908 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 505 transitions. [2019-10-13 23:01:30,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:30,908 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 505 transitions. [2019-10-13 23:01:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:01:30,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:30,909 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-13 23:01:30,910 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1173670243, now seen corresponding path program 1 times [2019-10-13 23:01:30,910 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:30,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127676023] [2019-10-13 23:01:30,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,913 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:30,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:30,993 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-13 23:01:30,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127676023] [2019-10-13 23:01:30,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:30,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:30,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468056971] [2019-10-13 23:01:30,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:30,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:30,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:30,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:30,996 INFO L87 Difference]: Start difference. First operand 440 states and 505 transitions. Second operand 9 states. [2019-10-13 23:01:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:31,192 INFO L93 Difference]: Finished difference Result 442 states and 506 transitions. [2019-10-13 23:01:31,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:31,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-10-13 23:01:31,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:31,196 INFO L225 Difference]: With dead ends: 442 [2019-10-13 23:01:31,196 INFO L226 Difference]: Without dead ends: 325 [2019-10-13 23:01:31,200 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-13 23:01:31,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-10-13 23:01:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2019-10-13 23:01:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-10-13 23:01:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 377 transitions. [2019-10-13 23:01:31,243 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 377 transitions. Word has length 60 [2019-10-13 23:01:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:31,243 INFO L462 AbstractCegarLoop]: Abstraction has 325 states and 377 transitions. [2019-10-13 23:01:31,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 377 transitions. [2019-10-13 23:01:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-13 23:01:31,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:31,246 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-13 23:01:31,246 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:31,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1733141653, now seen corresponding path program 1 times [2019-10-13 23:01:31,247 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:31,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037995860] [2019-10-13 23:01:31,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:31,348 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-13 23:01:31,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037995860] [2019-10-13 23:01:31,349 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:31,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:31,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119086606] [2019-10-13 23:01:31,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:31,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:31,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:31,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:31,351 INFO L87 Difference]: Start difference. First operand 325 states and 377 transitions. Second operand 7 states. [2019-10-13 23:01:31,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:31,484 INFO L93 Difference]: Finished difference Result 342 states and 393 transitions. [2019-10-13 23:01:31,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:01:31,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-10-13 23:01:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:31,488 INFO L225 Difference]: With dead ends: 342 [2019-10-13 23:01:31,488 INFO L226 Difference]: Without dead ends: 323 [2019-10-13 23:01:31,490 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-13 23:01:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-13 23:01:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 284. [2019-10-13 23:01:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-10-13 23:01:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 325 transitions. [2019-10-13 23:01:31,529 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 325 transitions. Word has length 71 [2019-10-13 23:01:31,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:31,530 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 325 transitions. [2019-10-13 23:01:31,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:31,530 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 325 transitions. [2019-10-13 23:01:31,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 23:01:31,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:31,532 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-13 23:01:31,533 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:31,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1012836717, now seen corresponding path program 1 times [2019-10-13 23:01:31,534 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:31,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007034867] [2019-10-13 23:01:31,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:31,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:31,686 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-13 23:01:31,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007034867] [2019-10-13 23:01:31,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:31,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:31,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656671403] [2019-10-13 23:01:31,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:31,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:31,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:31,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:31,689 INFO L87 Difference]: Start difference. First operand 284 states and 325 transitions. Second operand 9 states. [2019-10-13 23:01:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,127 INFO L93 Difference]: Finished difference Result 400 states and 454 transitions. [2019-10-13 23:01:32,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:32,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-10-13 23:01:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,129 INFO L225 Difference]: With dead ends: 400 [2019-10-13 23:01:32,129 INFO L226 Difference]: Without dead ends: 256 [2019-10-13 23:01:32,130 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-13 23:01:32,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-10-13 23:01:32,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2019-10-13 23:01:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-10-13 23:01:32,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 286 transitions. [2019-10-13 23:01:32,152 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 286 transitions. Word has length 72 [2019-10-13 23:01:32,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,152 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 286 transitions. [2019-10-13 23:01:32,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 286 transitions. [2019-10-13 23:01:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 23:01:32,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,154 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-13 23:01:32,155 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash -392261068, now seen corresponding path program 1 times [2019-10-13 23:01:32,155 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978522999] [2019-10-13 23:01:32,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,156 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,282 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-13 23:01:32,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978522999] [2019-10-13 23:01:32,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:01:32,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503835949] [2019-10-13 23:01:32,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:01:32,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:01:32,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:01:32,285 INFO L87 Difference]: Start difference. First operand 252 states and 286 transitions. Second operand 10 states. [2019-10-13 23:01:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,559 INFO L93 Difference]: Finished difference Result 294 states and 325 transitions. [2019-10-13 23:01:32,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:01:32,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2019-10-13 23:01:32,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,562 INFO L225 Difference]: With dead ends: 294 [2019-10-13 23:01:32,562 INFO L226 Difference]: Without dead ends: 232 [2019-10-13 23:01:32,563 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-13 23:01:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-13 23:01:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-10-13 23:01:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 23:01:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 262 transitions. [2019-10-13 23:01:32,655 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 262 transitions. Word has length 78 [2019-10-13 23:01:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,655 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 262 transitions. [2019-10-13 23:01:32,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:01:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 262 transitions. [2019-10-13 23:01:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 23:01:32,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,658 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-13 23:01:32,658 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash 220424145, now seen corresponding path program 1 times [2019-10-13 23:01:32,659 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490096041] [2019-10-13 23:01:32,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:32,810 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-13 23:01:32,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490096041] [2019-10-13 23:01:32,810 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:32,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:32,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641344557] [2019-10-13 23:01:32,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:32,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:32,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:32,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:32,812 INFO L87 Difference]: Start difference. First operand 232 states and 262 transitions. Second operand 11 states. [2019-10-13 23:01:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:32,949 INFO L93 Difference]: Finished difference Result 310 states and 347 transitions. [2019-10-13 23:01:32,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:32,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 83 [2019-10-13 23:01:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:32,951 INFO L225 Difference]: With dead ends: 310 [2019-10-13 23:01:32,951 INFO L226 Difference]: Without dead ends: 197 [2019-10-13 23:01:32,952 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-13 23:01:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-13 23:01:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2019-10-13 23:01:32,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-13 23:01:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 207 transitions. [2019-10-13 23:01:32,968 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 207 transitions. Word has length 83 [2019-10-13 23:01:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:32,968 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 207 transitions. [2019-10-13 23:01:32,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 207 transitions. [2019-10-13 23:01:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 23:01:32,969 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:32,970 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-13 23:01:32,970 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:32,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:32,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1811313841, now seen corresponding path program 1 times [2019-10-13 23:01:32,970 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:32,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208594256] [2019-10-13 23:01:32,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:32,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,057 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-13 23:01:33,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208594256] [2019-10-13 23:01:33,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:01:33,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248206319] [2019-10-13 23:01:33,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:01:33,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:01:33,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:01:33,059 INFO L87 Difference]: Start difference. First operand 189 states and 207 transitions. Second operand 7 states. [2019-10-13 23:01:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,263 INFO L93 Difference]: Finished difference Result 248 states and 279 transitions. [2019-10-13 23:01:33,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:01:33,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-10-13 23:01:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,266 INFO L225 Difference]: With dead ends: 248 [2019-10-13 23:01:33,266 INFO L226 Difference]: Without dead ends: 245 [2019-10-13 23:01:33,266 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-13 23:01:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-13 23:01:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 223. [2019-10-13 23:01:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-13 23:01:33,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2019-10-13 23:01:33,287 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 88 [2019-10-13 23:01:33,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,287 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2019-10-13 23:01:33,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:01:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2019-10-13 23:01:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 23:01:33,289 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:33,289 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-13 23:01:33,289 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:33,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:33,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1150229932, now seen corresponding path program 1 times [2019-10-13 23:01:33,290 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:33,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284907002] [2019-10-13 23:01:33,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,357 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-13 23:01:33,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284907002] [2019-10-13 23:01:33,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:33,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443483536] [2019-10-13 23:01:33,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:33,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:33,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:33,360 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand 5 states. [2019-10-13 23:01:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:33,566 INFO L93 Difference]: Finished difference Result 304 states and 334 transitions. [2019-10-13 23:01:33,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:01:33,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-10-13 23:01:33,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:33,568 INFO L225 Difference]: With dead ends: 304 [2019-10-13 23:01:33,568 INFO L226 Difference]: Without dead ends: 243 [2019-10-13 23:01:33,568 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-13 23:01:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-13 23:01:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 148. [2019-10-13 23:01:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-13 23:01:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2019-10-13 23:01:33,583 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 96 [2019-10-13 23:01:33,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:33,583 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2019-10-13 23:01:33,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2019-10-13 23:01:33,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 23:01:33,584 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:33,585 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-13 23:01:33,585 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:33,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:33,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1822011349, now seen corresponding path program 1 times [2019-10-13 23:01:33,585 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:33,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547075527] [2019-10-13 23:01:33,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:33,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:33,723 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-13 23:01:33,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547075527] [2019-10-13 23:01:33,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:33,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 23:01:33,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726100626] [2019-10-13 23:01:33,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 23:01:33,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:33,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 23:01:33,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 23:01:33,727 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand 13 states. [2019-10-13 23:01:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:34,029 INFO L93 Difference]: Finished difference Result 191 states and 210 transitions. [2019-10-13 23:01:34,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:01:34,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2019-10-13 23:01:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:34,031 INFO L225 Difference]: With dead ends: 191 [2019-10-13 23:01:34,031 INFO L226 Difference]: Without dead ends: 162 [2019-10-13 23:01:34,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:01:34,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-13 23:01:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2019-10-13 23:01:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-10-13 23:01:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2019-10-13 23:01:34,055 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 107 [2019-10-13 23:01:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:34,055 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2019-10-13 23:01:34,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 23:01:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2019-10-13 23:01:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 23:01:34,059 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:34,059 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-13 23:01:34,059 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:34,060 INFO L82 PathProgramCache]: Analyzing trace with hash -949307777, now seen corresponding path program 1 times [2019-10-13 23:01:34,060 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:34,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6286100] [2019-10-13 23:01:34,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:34,420 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-13 23:01:34,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6286100] [2019-10-13 23:01:34,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:34,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 23:01:34,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969115323] [2019-10-13 23:01:34,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:01:34,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:34,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:01:34,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:34,425 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand 11 states. [2019-10-13 23:01:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:34,567 INFO L93 Difference]: Finished difference Result 187 states and 199 transitions. [2019-10-13 23:01:34,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:01:34,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 120 [2019-10-13 23:01:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:34,569 INFO L225 Difference]: With dead ends: 187 [2019-10-13 23:01:34,569 INFO L226 Difference]: Without dead ends: 154 [2019-10-13 23:01:34,570 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-13 23:01:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-13 23:01:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-10-13 23:01:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-13 23:01:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 161 transitions. [2019-10-13 23:01:34,583 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 161 transitions. Word has length 120 [2019-10-13 23:01:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:34,583 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 161 transitions. [2019-10-13 23:01:34,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:01:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 161 transitions. [2019-10-13 23:01:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 23:01:34,585 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:34,585 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-13 23:01:34,586 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:34,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1669499445, now seen corresponding path program 1 times [2019-10-13 23:01:34,586 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:34,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860279032] [2019-10-13 23:01:34,586 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,587 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:34,707 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-13 23:01:34,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860279032] [2019-10-13 23:01:34,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:34,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:01:34,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925302904] [2019-10-13 23:01:34,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:01:34,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:34,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:01:34,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:01:34,710 INFO L87 Difference]: Start difference. First operand 154 states and 161 transitions. Second operand 5 states. [2019-10-13 23:01:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:34,809 INFO L93 Difference]: Finished difference Result 193 states and 200 transitions. [2019-10-13 23:01:34,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:01:34,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2019-10-13 23:01:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:34,810 INFO L225 Difference]: With dead ends: 193 [2019-10-13 23:01:34,810 INFO L226 Difference]: Without dead ends: 139 [2019-10-13 23:01:34,811 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-13 23:01:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-10-13 23:01:34,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-10-13 23:01:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-13 23:01:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2019-10-13 23:01:34,823 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 123 [2019-10-13 23:01:34,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:34,824 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2019-10-13 23:01:34,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:01:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2019-10-13 23:01:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 23:01:34,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:34,826 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-13 23:01:34,826 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:34,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:34,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1614696425, now seen corresponding path program 1 times [2019-10-13 23:01:34,826 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:34,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321724162] [2019-10-13 23:01:34,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:34,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:34,941 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-13 23:01:34,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321724162] [2019-10-13 23:01:34,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:34,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:01:34,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321559868] [2019-10-13 23:01:34,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:01:34,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:34,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:01:34,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:01:34,944 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 9 states. [2019-10-13 23:01:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:35,175 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2019-10-13 23:01:35,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:01:35,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-10-13 23:01:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:35,176 INFO L225 Difference]: With dead ends: 189 [2019-10-13 23:01:35,177 INFO L226 Difference]: Without dead ends: 138 [2019-10-13 23:01:35,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:01:35,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-13 23:01:35,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-10-13 23:01:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-13 23:01:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-10-13 23:01:35,189 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 125 [2019-10-13 23:01:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:35,190 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-10-13 23:01:35,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:01:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-10-13 23:01:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 23:01:35,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:01:35,191 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-13 23:01:35,191 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:01:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:01:35,192 INFO L82 PathProgramCache]: Analyzing trace with hash 618335336, now seen corresponding path program 1 times [2019-10-13 23:01:35,192 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:01:35,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339554871] [2019-10-13 23:01:35,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:35,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:01:35,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:01:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:01:35,464 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-13 23:01:35,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339554871] [2019-10-13 23:01:35,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:01:35,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 23:01:35,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41677112] [2019-10-13 23:01:35,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 23:01:35,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:01:35,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 23:01:35,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:01:35,469 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 14 states. [2019-10-13 23:01:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:01:36,425 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2019-10-13 23:01:36,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 23:01:36,426 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 125 [2019-10-13 23:01:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:01:36,427 INFO L225 Difference]: With dead ends: 141 [2019-10-13 23:01:36,427 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 23:01:36,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2019-10-13 23:01:36,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 23:01:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 23:01:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 23:01:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 23:01:36,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2019-10-13 23:01:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:01:36,430 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 23:01:36,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 23:01:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 23:01:36,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 23:01:36,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 23:01:37,813 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-10-13 23:01:37,965 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-10-13 23:01:38,425 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 85 [2019-10-13 23:01:38,788 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 51 [2019-10-13 23:01:39,006 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2019-10-13 23:01:39,309 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 62 [2019-10-13 23:01:39,592 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-10-13 23:01:40,007 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 79 [2019-10-13 23:01:40,140 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 1 [2019-10-13 23:01:40,502 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-10-13 23:01:40,665 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2019-10-13 23:01:40,907 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-10-13 23:01:41,128 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 66 [2019-10-13 23:01:41,304 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-10-13 23:01:41,480 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 1 [2019-10-13 23:01:41,899 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2019-10-13 23:01:42,410 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 70 [2019-10-13 23:01:42,923 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2019-10-13 23:01:43,546 WARN L191 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 91 [2019-10-13 23:01:43,689 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-10-13 23:01:44,018 WARN L191 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-10-13 23:01:44,138 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-10-13 23:01:44,344 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 69 [2019-10-13 23:01:44,567 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-10-13 23:01:44,792 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2019-10-13 23:01:45,056 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-10-13 23:01:45,198 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-10-13 23:01:45,762 WARN L191 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 84 [2019-10-13 23:01:45,983 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-10-13 23:01:46,176 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 66 [2019-10-13 23:01:46,583 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-10-13 23:01:46,965 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 86 [2019-10-13 23:01:47,086 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 1 [2019-10-13 23:01:47,659 WARN L191 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 96 [2019-10-13 23:01:47,849 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-10-13 23:01:48,049 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-10-13 23:01:48,152 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-13 23:01:48,254 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-10-13 23:01:48,364 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 1 [2019-10-13 23:01:48,526 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-10-13 23:01:48,771 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 59