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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:08:04,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:08:04,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:08:04,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:08:04,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:08:04,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:08:04,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:08:04,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:08:04,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:08:04,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:08:04,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:08:04,124 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:08:04,125 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:08:04,126 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:08:04,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:08:04,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:08:04,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:08:04,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:08:04,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:08:04,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:08:04,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:08:04,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:08:04,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:08:04,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:08:04,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:08:04,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:08:04,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:08:04,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:08:04,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:08:04,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:08:04,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:08:04,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:08:04,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:08:04,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:08:04,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:08:04,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:08:04,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:08:04,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:08:04,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:08:04,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:08:04,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:08:04,150 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 21:08:04,178 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:08:04,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:08:04,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:08:04,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:08:04,180 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:08:04,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:08:04,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:08:04,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:08:04,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:08:04,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:08:04,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:08:04,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:08:04,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:08:04,185 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:08:04,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:08:04,185 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:08:04,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:08:04,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:08:04,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:08:04,186 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:08:04,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:08:04,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:08:04,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:08:04,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:08:04,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:08:04,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:08:04,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:08:04,188 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:08:04,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:08:04,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:08:04,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:08:04,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:08:04,471 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:08:04,471 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:08:04,472 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-13 21:08:04,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef4ebba2/aaf27843024a47d2b5f674737554eecf/FLAG0a00958f8 [2019-10-13 21:08:05,104 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:08:05,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-10-13 21:08:05,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef4ebba2/aaf27843024a47d2b5f674737554eecf/FLAG0a00958f8 [2019-10-13 21:08:05,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bef4ebba2/aaf27843024a47d2b5f674737554eecf [2019-10-13 21:08:05,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:08:05,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:08:05,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:08:05,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:08:05,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:08:05,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:08:05" (1/1) ... [2019-10-13 21:08:05,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef99201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:05, skipping insertion in model container [2019-10-13 21:08:05,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:08:05" (1/1) ... [2019-10-13 21:08:05,392 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:08:05,459 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:08:06,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:08:06,020 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:08:06,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:08:06,170 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:08:06,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:06 WrapperNode [2019-10-13 21:08:06,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:08:06,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:08:06,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:08:06,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:08:06,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:06" (1/1) ... [2019-10-13 21:08:06,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:06" (1/1) ... [2019-10-13 21:08:06,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:06" (1/1) ... [2019-10-13 21:08:06,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:06" (1/1) ... [2019-10-13 21:08:06,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:06" (1/1) ... [2019-10-13 21:08:06,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:06" (1/1) ... [2019-10-13 21:08:06,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:06" (1/1) ... [2019-10-13 21:08:06,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:08:06,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:08:06,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:08:06,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:08:06,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:06" (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 21:08:06,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:08:06,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:08:06,346 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-13 21:08:06,346 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2019-10-13 21:08:06,346 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2019-10-13 21:08:06,347 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2019-10-13 21:08:06,347 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2019-10-13 21:08:06,347 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2019-10-13 21:08:06,347 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2019-10-13 21:08:06,347 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2019-10-13 21:08:06,347 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-13 21:08:06,348 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:08:06,348 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-13 21:08:06,348 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2019-10-13 21:08:06,348 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2019-10-13 21:08:06,348 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2019-10-13 21:08:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2019-10-13 21:08:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-13 21:08:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-13 21:08:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-13 21:08:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-13 21:08:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-13 21:08:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2019-10-13 21:08:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2019-10-13 21:08:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2019-10-13 21:08:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2019-10-13 21:08:06,350 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2019-10-13 21:08:06,351 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2019-10-13 21:08:06,351 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2019-10-13 21:08:06,351 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-13 21:08:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:08:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:08:06,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:08:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 21:08:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 21:08:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2019-10-13 21:08:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2019-10-13 21:08:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2019-10-13 21:08:06,352 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2019-10-13 21:08:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2019-10-13 21:08:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2019-10-13 21:08:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-13 21:08:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2019-10-13 21:08:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2019-10-13 21:08:06,353 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2019-10-13 21:08:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2019-10-13 21:08:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-13 21:08:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-13 21:08:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-13 21:08:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2019-10-13 21:08:06,354 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2019-10-13 21:08:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2019-10-13 21:08:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2019-10-13 21:08:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2019-10-13 21:08:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2019-10-13 21:08:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2019-10-13 21:08:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-13 21:08:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-13 21:08:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-13 21:08:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2019-10-13 21:08:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-13 21:08:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:08:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-13 21:08:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:08:06,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:08:06,786 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:06,851 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 21:08:06,852 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 21:08:06,859 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:06,885 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 21:08:06,886 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 21:08:06,898 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,181 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-10-13 21:08:07,182 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-10-13 21:08:07,184 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,297 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-10-13 21:08:07,298 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-10-13 21:08:07,328 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,359 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-13 21:08:07,360 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-13 21:08:07,470 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,482 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 21:08:07,483 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 21:08:07,483 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,517 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 21:08:07,518 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 21:08:07,519 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,532 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 21:08:07,532 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 21:08:07,581 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,618 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2019-10-13 21:08:07,618 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2019-10-13 21:08:07,622 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,779 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2019-10-13 21:08:07,779 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2019-10-13 21:08:07,837 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,843 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 21:08:07,844 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 21:08:07,844 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,861 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 21:08:07,861 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 21:08:07,862 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 21:08:07,868 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-13 21:08:07,868 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-13 21:08:07,885 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:08:07,888 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:08:07,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:08:07 BoogieIcfgContainer [2019-10-13 21:08:07,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:08:07,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:08:07,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:08:07,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:08:07,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:08:05" (1/3) ... [2019-10-13 21:08:07,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd8e139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:08:07, skipping insertion in model container [2019-10-13 21:08:07,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:08:06" (2/3) ... [2019-10-13 21:08:07,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd8e139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:08:07, skipping insertion in model container [2019-10-13 21:08:07,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:08:07" (3/3) ... [2019-10-13 21:08:07,909 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-10-13 21:08:07,921 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:08:07,933 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:08:07,944 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:08:07,975 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:08:07,975 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:08:07,975 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:08:07,975 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:08:07,975 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:08:07,976 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:08:07,976 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:08:07,976 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:08:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states. [2019-10-13 21:08:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:08:08,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:08,010 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] [2019-10-13 21:08:08,012 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:08,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash 513471565, now seen corresponding path program 1 times [2019-10-13 21:08:08,027 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:08,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992813446] [2019-10-13 21:08:08,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:08,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:08,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:08,305 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 21:08:08,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992813446] [2019-10-13 21:08:08,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:08,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:08,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551985757] [2019-10-13 21:08:08,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:08,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:08,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:08,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:08,332 INFO L87 Difference]: Start difference. First operand 389 states. Second operand 3 states. [2019-10-13 21:08:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:08,494 INFO L93 Difference]: Finished difference Result 624 states and 909 transitions. [2019-10-13 21:08:08,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:08,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-13 21:08:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:08,514 INFO L225 Difference]: With dead ends: 624 [2019-10-13 21:08:08,514 INFO L226 Difference]: Without dead ends: 380 [2019-10-13 21:08:08,522 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 21:08:08,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-13 21:08:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2019-10-13 21:08:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-13 21:08:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2019-10-13 21:08:08,623 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2019-10-13 21:08:08,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:08,624 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2019-10-13 21:08:08,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2019-10-13 21:08:08,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 21:08:08,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:08,629 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] [2019-10-13 21:08:08,631 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:08,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2120474792, now seen corresponding path program 1 times [2019-10-13 21:08:08,633 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:08,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768907032] [2019-10-13 21:08:08,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:08,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:08,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:08,836 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 21:08:08,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768907032] [2019-10-13 21:08:08,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:08,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:08,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983288160] [2019-10-13 21:08:08,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:08,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:08,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:08,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:08,840 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand 3 states. [2019-10-13 21:08:09,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:09,089 INFO L93 Difference]: Finished difference Result 699 states and 950 transitions. [2019-10-13 21:08:09,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:09,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 21:08:09,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:09,107 INFO L225 Difference]: With dead ends: 699 [2019-10-13 21:08:09,107 INFO L226 Difference]: Without dead ends: 536 [2019-10-13 21:08:09,110 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 21:08:09,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-13 21:08:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 519. [2019-10-13 21:08:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2019-10-13 21:08:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 706 transitions. [2019-10-13 21:08:09,256 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 706 transitions. Word has length 25 [2019-10-13 21:08:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:09,257 INFO L462 AbstractCegarLoop]: Abstraction has 519 states and 706 transitions. [2019-10-13 21:08:09,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 706 transitions. [2019-10-13 21:08:09,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:08:09,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:09,261 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] [2019-10-13 21:08:09,261 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:09,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:09,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1525052010, now seen corresponding path program 1 times [2019-10-13 21:08:09,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:09,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246891187] [2019-10-13 21:08:09,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:09,263 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:09,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:09,444 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 21:08:09,445 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246891187] [2019-10-13 21:08:09,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:09,446 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:09,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120742366] [2019-10-13 21:08:09,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:09,447 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:09,448 INFO L87 Difference]: Start difference. First operand 519 states and 706 transitions. Second operand 3 states. [2019-10-13 21:08:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:09,516 INFO L93 Difference]: Finished difference Result 642 states and 859 transitions. [2019-10-13 21:08:09,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:09,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 21:08:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:09,524 INFO L225 Difference]: With dead ends: 642 [2019-10-13 21:08:09,525 INFO L226 Difference]: Without dead ends: 623 [2019-10-13 21:08:09,526 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 21:08:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-13 21:08:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 577. [2019-10-13 21:08:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-13 21:08:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 780 transitions. [2019-10-13 21:08:09,577 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 780 transitions. Word has length 31 [2019-10-13 21:08:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:09,578 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 780 transitions. [2019-10-13 21:08:09,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 780 transitions. [2019-10-13 21:08:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 21:08:09,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:09,580 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] [2019-10-13 21:08:09,580 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:09,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1803096900, now seen corresponding path program 1 times [2019-10-13 21:08:09,581 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:09,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292110958] [2019-10-13 21:08:09,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:09,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:09,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:09,653 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 21:08:09,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292110958] [2019-10-13 21:08:09,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:09,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:09,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464347951] [2019-10-13 21:08:09,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:09,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:09,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:09,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:09,655 INFO L87 Difference]: Start difference. First operand 577 states and 780 transitions. Second operand 3 states. [2019-10-13 21:08:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:09,719 INFO L93 Difference]: Finished difference Result 1080 states and 1455 transitions. [2019-10-13 21:08:09,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:09,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 21:08:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:09,725 INFO L225 Difference]: With dead ends: 1080 [2019-10-13 21:08:09,726 INFO L226 Difference]: Without dead ends: 788 [2019-10-13 21:08:09,727 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 21:08:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-13 21:08:09,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 759. [2019-10-13 21:08:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-10-13 21:08:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1030 transitions. [2019-10-13 21:08:09,779 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1030 transitions. Word has length 33 [2019-10-13 21:08:09,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:09,780 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1030 transitions. [2019-10-13 21:08:09,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1030 transitions. [2019-10-13 21:08:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:08:09,783 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:09,783 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:09,783 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:09,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1275107652, now seen corresponding path program 1 times [2019-10-13 21:08:09,784 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:09,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548463810] [2019-10-13 21:08:09,784 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:09,785 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:09,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:09,832 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 21:08:09,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548463810] [2019-10-13 21:08:09,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:09,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:09,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175602145] [2019-10-13 21:08:09,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:09,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:09,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:09,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:09,835 INFO L87 Difference]: Start difference. First operand 759 states and 1030 transitions. Second operand 3 states. [2019-10-13 21:08:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:09,943 INFO L93 Difference]: Finished difference Result 795 states and 1072 transitions. [2019-10-13 21:08:09,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:09,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-13 21:08:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:09,950 INFO L225 Difference]: With dead ends: 795 [2019-10-13 21:08:09,950 INFO L226 Difference]: Without dead ends: 790 [2019-10-13 21:08:09,951 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 21:08:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-13 21:08:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-10-13 21:08:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-13 21:08:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1065 transitions. [2019-10-13 21:08:10,003 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1065 transitions. Word has length 39 [2019-10-13 21:08:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:10,006 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1065 transitions. [2019-10-13 21:08:10,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1065 transitions. [2019-10-13 21:08:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 21:08:10,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:10,009 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 21:08:10,009 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:10,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1074736541, now seen corresponding path program 1 times [2019-10-13 21:08:10,010 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:10,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612533453] [2019-10-13 21:08:10,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:10,010 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:10,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:10,094 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 21:08:10,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612533453] [2019-10-13 21:08:10,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:10,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:10,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014359071] [2019-10-13 21:08:10,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:10,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:10,096 INFO L87 Difference]: Start difference. First operand 788 states and 1065 transitions. Second operand 3 states. [2019-10-13 21:08:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:10,256 INFO L93 Difference]: Finished difference Result 803 states and 1085 transitions. [2019-10-13 21:08:10,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:10,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-13 21:08:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:10,263 INFO L225 Difference]: With dead ends: 803 [2019-10-13 21:08:10,263 INFO L226 Difference]: Without dead ends: 800 [2019-10-13 21:08:10,264 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 21:08:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-10-13 21:08:10,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 799. [2019-10-13 21:08:10,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-10-13 21:08:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1079 transitions. [2019-10-13 21:08:10,306 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1079 transitions. Word has length 38 [2019-10-13 21:08:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:10,307 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1079 transitions. [2019-10-13 21:08:10,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1079 transitions. [2019-10-13 21:08:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 21:08:10,310 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:10,310 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:10,311 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:10,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1033738490, now seen corresponding path program 1 times [2019-10-13 21:08:10,311 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:10,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720154523] [2019-10-13 21:08:10,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:10,312 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:10,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:10,380 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 21:08:10,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720154523] [2019-10-13 21:08:10,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:10,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:10,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23525334] [2019-10-13 21:08:10,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:10,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:10,383 INFO L87 Difference]: Start difference. First operand 799 states and 1079 transitions. Second operand 5 states. [2019-10-13 21:08:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:10,464 INFO L93 Difference]: Finished difference Result 812 states and 1093 transitions. [2019-10-13 21:08:10,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:08:10,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-13 21:08:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:10,470 INFO L225 Difference]: With dead ends: 812 [2019-10-13 21:08:10,471 INFO L226 Difference]: Without dead ends: 797 [2019-10-13 21:08:10,472 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 21:08:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-10-13 21:08:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-10-13 21:08:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-13 21:08:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1075 transitions. [2019-10-13 21:08:10,520 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1075 transitions. Word has length 39 [2019-10-13 21:08:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:10,520 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1075 transitions. [2019-10-13 21:08:10,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1075 transitions. [2019-10-13 21:08:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 21:08:10,527 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:10,527 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 21:08:10,527 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:10,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1325280387, now seen corresponding path program 1 times [2019-10-13 21:08:10,528 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:10,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917520582] [2019-10-13 21:08:10,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:10,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:10,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:10,593 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 21:08:10,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917520582] [2019-10-13 21:08:10,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:10,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:10,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490585407] [2019-10-13 21:08:10,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:10,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:10,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:10,597 INFO L87 Difference]: Start difference. First operand 797 states and 1075 transitions. Second operand 5 states. [2019-10-13 21:08:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:10,666 INFO L93 Difference]: Finished difference Result 810 states and 1089 transitions. [2019-10-13 21:08:10,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:08:10,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-13 21:08:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:10,675 INFO L225 Difference]: With dead ends: 810 [2019-10-13 21:08:10,676 INFO L226 Difference]: Without dead ends: 790 [2019-10-13 21:08:10,678 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 21:08:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-13 21:08:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-10-13 21:08:10,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-13 21:08:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-10-13 21:08:10,725 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 40 [2019-10-13 21:08:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:10,725 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-10-13 21:08:10,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-10-13 21:08:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 21:08:10,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:10,729 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 21:08:10,729 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1677893832, now seen corresponding path program 1 times [2019-10-13 21:08:10,730 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:10,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491966545] [2019-10-13 21:08:10,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:10,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:10,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:08:10,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491966545] [2019-10-13 21:08:10,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:10,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:10,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098053748] [2019-10-13 21:08:10,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:10,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:10,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:10,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:10,801 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-10-13 21:08:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:10,956 INFO L93 Difference]: Finished difference Result 1168 states and 1590 transitions. [2019-10-13 21:08:10,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:10,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-13 21:08:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:10,964 INFO L225 Difference]: With dead ends: 1168 [2019-10-13 21:08:10,964 INFO L226 Difference]: Without dead ends: 1165 [2019-10-13 21:08:10,965 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 21:08:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-10-13 21:08:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 913. [2019-10-13 21:08:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-13 21:08:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1235 transitions. [2019-10-13 21:08:11,019 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1235 transitions. Word has length 44 [2019-10-13 21:08:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:11,019 INFO L462 AbstractCegarLoop]: Abstraction has 913 states and 1235 transitions. [2019-10-13 21:08:11,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1235 transitions. [2019-10-13 21:08:11,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 21:08:11,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:11,021 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 21:08:11,021 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash 2097381887, now seen corresponding path program 1 times [2019-10-13 21:08:11,022 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:11,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788067029] [2019-10-13 21:08:11,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:11,022 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:11,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:11,113 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 21:08:11,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788067029] [2019-10-13 21:08:11,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:11,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:08:11,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337896521] [2019-10-13 21:08:11,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:08:11,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:11,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:08:11,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:08:11,116 INFO L87 Difference]: Start difference. First operand 913 states and 1235 transitions. Second operand 8 states. [2019-10-13 21:08:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:11,918 INFO L93 Difference]: Finished difference Result 935 states and 1257 transitions. [2019-10-13 21:08:11,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:08:11,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-13 21:08:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:11,925 INFO L225 Difference]: With dead ends: 935 [2019-10-13 21:08:11,925 INFO L226 Difference]: Without dead ends: 929 [2019-10-13 21:08:11,930 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 21:08:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-10-13 21:08:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 913. [2019-10-13 21:08:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-10-13 21:08:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1234 transitions. [2019-10-13 21:08:12,019 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1234 transitions. Word has length 43 [2019-10-13 21:08:12,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:12,019 INFO L462 AbstractCegarLoop]: Abstraction has 913 states and 1234 transitions. [2019-10-13 21:08:12,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:08:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1234 transitions. [2019-10-13 21:08:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 21:08:12,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:12,021 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:12,021 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:12,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:12,022 INFO L82 PathProgramCache]: Analyzing trace with hash 667497540, now seen corresponding path program 1 times [2019-10-13 21:08:12,022 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:12,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708727742] [2019-10-13 21:08:12,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:12,024 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:12,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:12,106 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 21:08:12,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708727742] [2019-10-13 21:08:12,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:12,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:08:12,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10763486] [2019-10-13 21:08:12,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:08:12,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:12,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:08:12,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:08:12,109 INFO L87 Difference]: Start difference. First operand 913 states and 1234 transitions. Second operand 4 states. [2019-10-13 21:08:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:12,200 INFO L93 Difference]: Finished difference Result 941 states and 1267 transitions. [2019-10-13 21:08:12,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:08:12,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-10-13 21:08:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:12,206 INFO L225 Difference]: With dead ends: 941 [2019-10-13 21:08:12,206 INFO L226 Difference]: Without dead ends: 919 [2019-10-13 21:08:12,207 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-10-13 21:08:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 915. [2019-10-13 21:08:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2019-10-13 21:08:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1236 transitions. [2019-10-13 21:08:12,259 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1236 transitions. Word has length 42 [2019-10-13 21:08:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:12,259 INFO L462 AbstractCegarLoop]: Abstraction has 915 states and 1236 transitions. [2019-10-13 21:08:12,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:08:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1236 transitions. [2019-10-13 21:08:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 21:08:12,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:12,261 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 21:08:12,261 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash 237043572, now seen corresponding path program 1 times [2019-10-13 21:08:12,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:12,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456849639] [2019-10-13 21:08:12,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:12,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:12,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:12,388 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 21:08:12,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456849639] [2019-10-13 21:08:12,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:12,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:08:12,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480610306] [2019-10-13 21:08:12,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:08:12,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:12,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:08:12,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:08:12,390 INFO L87 Difference]: Start difference. First operand 915 states and 1236 transitions. Second operand 8 states. [2019-10-13 21:08:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:13,395 INFO L93 Difference]: Finished difference Result 1641 states and 2187 transitions. [2019-10-13 21:08:13,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:08:13,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-10-13 21:08:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:13,403 INFO L225 Difference]: With dead ends: 1641 [2019-10-13 21:08:13,403 INFO L226 Difference]: Without dead ends: 1090 [2019-10-13 21:08:13,405 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 21:08:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-10-13 21:08:13,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 906. [2019-10-13 21:08:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-13 21:08:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1215 transitions. [2019-10-13 21:08:13,462 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1215 transitions. Word has length 45 [2019-10-13 21:08:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:13,462 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1215 transitions. [2019-10-13 21:08:13,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:08:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1215 transitions. [2019-10-13 21:08:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 21:08:13,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:13,464 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 21:08:13,465 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:13,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash -266291307, now seen corresponding path program 1 times [2019-10-13 21:08:13,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:13,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933064954] [2019-10-13 21:08:13,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:13,466 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:13,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:13,563 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 21:08:13,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933064954] [2019-10-13 21:08:13,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:13,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:08:13,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141774329] [2019-10-13 21:08:13,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:08:13,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:13,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:08:13,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:08:13,565 INFO L87 Difference]: Start difference. First operand 906 states and 1215 transitions. Second operand 8 states. [2019-10-13 21:08:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:14,401 INFO L93 Difference]: Finished difference Result 928 states and 1236 transitions. [2019-10-13 21:08:14,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:08:14,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2019-10-13 21:08:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:14,406 INFO L225 Difference]: With dead ends: 928 [2019-10-13 21:08:14,407 INFO L226 Difference]: Without dead ends: 922 [2019-10-13 21:08:14,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:08:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-10-13 21:08:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 906. [2019-10-13 21:08:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-13 21:08:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-10-13 21:08:14,465 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 44 [2019-10-13 21:08:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:14,467 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-10-13 21:08:14,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:08:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-10-13 21:08:14,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 21:08:14,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:14,469 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 21:08:14,469 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:14,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2124566473, now seen corresponding path program 1 times [2019-10-13 21:08:14,470 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:14,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864052087] [2019-10-13 21:08:14,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:14,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:14,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:08:14,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864052087] [2019-10-13 21:08:14,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:14,526 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:08:14,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19115507] [2019-10-13 21:08:14,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:08:14,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:14,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:08:14,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:08:14,528 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 4 states. [2019-10-13 21:08:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:14,604 INFO L93 Difference]: Finished difference Result 934 states and 1247 transitions. [2019-10-13 21:08:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:08:14,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-13 21:08:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:14,609 INFO L225 Difference]: With dead ends: 934 [2019-10-13 21:08:14,609 INFO L226 Difference]: Without dead ends: 912 [2019-10-13 21:08:14,611 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-10-13 21:08:14,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 906. [2019-10-13 21:08:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-13 21:08:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1214 transitions. [2019-10-13 21:08:14,663 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1214 transitions. Word has length 43 [2019-10-13 21:08:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:14,663 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1214 transitions. [2019-10-13 21:08:14,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:08:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1214 transitions. [2019-10-13 21:08:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 21:08:14,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:14,667 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 21:08:14,667 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash 418451048, now seen corresponding path program 1 times [2019-10-13 21:08:14,668 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:14,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378102993] [2019-10-13 21:08:14,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:14,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:14,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:14,736 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 21:08:14,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378102993] [2019-10-13 21:08:14,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:14,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:14,737 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447124717] [2019-10-13 21:08:14,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:14,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:14,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:14,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:14,739 INFO L87 Difference]: Start difference. First operand 906 states and 1214 transitions. Second operand 5 states. [2019-10-13 21:08:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:14,798 INFO L93 Difference]: Finished difference Result 922 states and 1229 transitions. [2019-10-13 21:08:14,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:08:14,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-13 21:08:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:14,804 INFO L225 Difference]: With dead ends: 922 [2019-10-13 21:08:14,804 INFO L226 Difference]: Without dead ends: 904 [2019-10-13 21:08:14,805 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 21:08:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2019-10-13 21:08:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 904. [2019-10-13 21:08:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-13 21:08:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1210 transitions. [2019-10-13 21:08:14,854 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1210 transitions. Word has length 45 [2019-10-13 21:08:14,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:14,855 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1210 transitions. [2019-10-13 21:08:14,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:14,855 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1210 transitions. [2019-10-13 21:08:14,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 21:08:14,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:14,857 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 21:08:14,857 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:14,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1008250026, now seen corresponding path program 1 times [2019-10-13 21:08:14,858 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:14,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204998747] [2019-10-13 21:08:14,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:14,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:14,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:14,900 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 21:08:14,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204998747] [2019-10-13 21:08:14,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:14,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:14,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611938848] [2019-10-13 21:08:14,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:14,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:14,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:14,902 INFO L87 Difference]: Start difference. First operand 904 states and 1210 transitions. Second operand 3 states. [2019-10-13 21:08:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:14,972 INFO L93 Difference]: Finished difference Result 944 states and 1257 transitions. [2019-10-13 21:08:14,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:14,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-13 21:08:14,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:14,980 INFO L225 Difference]: With dead ends: 944 [2019-10-13 21:08:14,980 INFO L226 Difference]: Without dead ends: 868 [2019-10-13 21:08:14,981 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 21:08:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-13 21:08:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 865. [2019-10-13 21:08:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-10-13 21:08:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1159 transitions. [2019-10-13 21:08:15,040 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1159 transitions. Word has length 46 [2019-10-13 21:08:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:15,041 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1159 transitions. [2019-10-13 21:08:15,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1159 transitions. [2019-10-13 21:08:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 21:08:15,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:15,043 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 21:08:15,044 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:15,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:15,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1391552118, now seen corresponding path program 1 times [2019-10-13 21:08:15,044 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:15,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401866708] [2019-10-13 21:08:15,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:15,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:15,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:15,176 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 21:08:15,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401866708] [2019-10-13 21:08:15,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:15,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:15,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645680784] [2019-10-13 21:08:15,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:15,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:15,179 INFO L87 Difference]: Start difference. First operand 865 states and 1159 transitions. Second operand 5 states. [2019-10-13 21:08:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:15,244 INFO L93 Difference]: Finished difference Result 881 states and 1174 transitions. [2019-10-13 21:08:15,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:08:15,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-13 21:08:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:15,251 INFO L225 Difference]: With dead ends: 881 [2019-10-13 21:08:15,252 INFO L226 Difference]: Without dead ends: 863 [2019-10-13 21:08:15,253 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 21:08:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-10-13 21:08:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-10-13 21:08:15,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-10-13 21:08:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1155 transitions. [2019-10-13 21:08:15,315 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1155 transitions. Word has length 47 [2019-10-13 21:08:15,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:15,316 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1155 transitions. [2019-10-13 21:08:15,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1155 transitions. [2019-10-13 21:08:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 21:08:15,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:15,319 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] [2019-10-13 21:08:15,319 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:15,320 INFO L82 PathProgramCache]: Analyzing trace with hash 868426094, now seen corresponding path program 1 times [2019-10-13 21:08:15,320 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:15,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921044965] [2019-10-13 21:08:15,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:15,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:15,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:15,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 21:08:15,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921044965] [2019-10-13 21:08:15,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:15,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:08:15,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670971454] [2019-10-13 21:08:15,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:08:15,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:08:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:08:15,392 INFO L87 Difference]: Start difference. First operand 863 states and 1155 transitions. Second operand 4 states. [2019-10-13 21:08:15,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:15,605 INFO L93 Difference]: Finished difference Result 947 states and 1238 transitions. [2019-10-13 21:08:15,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:08:15,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-10-13 21:08:15,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:15,610 INFO L225 Difference]: With dead ends: 947 [2019-10-13 21:08:15,610 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:08:15,612 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 21:08:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:08:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 577. [2019-10-13 21:08:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-13 21:08:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 748 transitions. [2019-10-13 21:08:15,643 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 748 transitions. Word has length 52 [2019-10-13 21:08:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:15,643 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 748 transitions. [2019-10-13 21:08:15,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:08:15,643 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 748 transitions. [2019-10-13 21:08:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 21:08:15,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:15,645 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 21:08:15,646 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:15,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:15,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1378147806, now seen corresponding path program 1 times [2019-10-13 21:08:15,647 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:15,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946824789] [2019-10-13 21:08:15,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:15,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:15,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:15,707 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 21:08:15,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946824789] [2019-10-13 21:08:15,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:15,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:08:15,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700683568] [2019-10-13 21:08:15,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:08:15,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:15,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:08:15,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:08:15,709 INFO L87 Difference]: Start difference. First operand 577 states and 748 transitions. Second operand 6 states. [2019-10-13 21:08:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:15,805 INFO L93 Difference]: Finished difference Result 597 states and 768 transitions. [2019-10-13 21:08:15,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:08:15,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-13 21:08:15,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:15,811 INFO L225 Difference]: With dead ends: 597 [2019-10-13 21:08:15,811 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 21:08:15,812 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 21:08:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 21:08:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-13 21:08:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-13 21:08:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 736 transitions. [2019-10-13 21:08:15,847 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 736 transitions. Word has length 50 [2019-10-13 21:08:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:15,848 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 736 transitions. [2019-10-13 21:08:15,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:08:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 736 transitions. [2019-10-13 21:08:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 21:08:15,850 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:15,851 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 21:08:15,851 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:15,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:15,851 INFO L82 PathProgramCache]: Analyzing trace with hash 994153444, now seen corresponding path program 1 times [2019-10-13 21:08:15,851 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:15,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037435084] [2019-10-13 21:08:15,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:15,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:15,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:15,905 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 21:08:15,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037435084] [2019-10-13 21:08:15,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:15,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:15,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284907002] [2019-10-13 21:08:15,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:15,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:15,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:15,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:15,908 INFO L87 Difference]: Start difference. First operand 577 states and 736 transitions. Second operand 3 states. [2019-10-13 21:08:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:16,057 INFO L93 Difference]: Finished difference Result 779 states and 1004 transitions. [2019-10-13 21:08:16,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:16,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-13 21:08:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:16,062 INFO L225 Difference]: With dead ends: 779 [2019-10-13 21:08:16,063 INFO L226 Difference]: Without dead ends: 752 [2019-10-13 21:08:16,064 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 21:08:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-10-13 21:08:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 622. [2019-10-13 21:08:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-10-13 21:08:16,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 793 transitions. [2019-10-13 21:08:16,109 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 793 transitions. Word has length 50 [2019-10-13 21:08:16,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:16,110 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 793 transitions. [2019-10-13 21:08:16,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:16,110 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 793 transitions. [2019-10-13 21:08:16,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 21:08:16,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:16,111 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 21:08:16,112 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:16,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:16,112 INFO L82 PathProgramCache]: Analyzing trace with hash -12540829, now seen corresponding path program 1 times [2019-10-13 21:08:16,112 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:16,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523269984] [2019-10-13 21:08:16,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:16,113 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:16,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:16,183 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 21:08:16,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523269984] [2019-10-13 21:08:16,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:16,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:08:16,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830965430] [2019-10-13 21:08:16,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:08:16,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:16,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:08:16,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:08:16,227 INFO L87 Difference]: Start difference. First operand 622 states and 793 transitions. Second operand 7 states. [2019-10-13 21:08:16,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:16,345 INFO L93 Difference]: Finished difference Result 661 states and 836 transitions. [2019-10-13 21:08:16,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:08:16,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-13 21:08:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:16,349 INFO L225 Difference]: With dead ends: 661 [2019-10-13 21:08:16,349 INFO L226 Difference]: Without dead ends: 612 [2019-10-13 21:08:16,350 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 21:08:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-13 21:08:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-10-13 21:08:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 21:08:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 774 transitions. [2019-10-13 21:08:16,385 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 774 transitions. Word has length 51 [2019-10-13 21:08:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:16,386 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 774 transitions. [2019-10-13 21:08:16,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:08:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 774 transitions. [2019-10-13 21:08:16,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 21:08:16,387 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:16,387 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 21:08:16,388 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:16,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:16,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1421151086, now seen corresponding path program 1 times [2019-10-13 21:08:16,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:16,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395937541] [2019-10-13 21:08:16,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:16,389 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:16,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:16,452 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 21:08:16,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395937541] [2019-10-13 21:08:16,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:16,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:08:16,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920411864] [2019-10-13 21:08:16,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:08:16,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:08:16,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:08:16,455 INFO L87 Difference]: Start difference. First operand 610 states and 774 transitions. Second operand 6 states. [2019-10-13 21:08:16,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:16,518 INFO L93 Difference]: Finished difference Result 637 states and 805 transitions. [2019-10-13 21:08:16,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:08:16,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-13 21:08:16,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:16,526 INFO L225 Difference]: With dead ends: 637 [2019-10-13 21:08:16,526 INFO L226 Difference]: Without dead ends: 612 [2019-10-13 21:08:16,527 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 21:08:16,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-13 21:08:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-13 21:08:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-13 21:08:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 776 transitions. [2019-10-13 21:08:16,573 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 776 transitions. Word has length 51 [2019-10-13 21:08:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:16,573 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 776 transitions. [2019-10-13 21:08:16,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:08:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 776 transitions. [2019-10-13 21:08:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 21:08:16,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:16,576 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 21:08:16,576 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:16,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1205911361, now seen corresponding path program 1 times [2019-10-13 21:08:16,577 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:16,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084089548] [2019-10-13 21:08:16,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:16,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:16,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:16,653 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 21:08:16,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084089548] [2019-10-13 21:08:16,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:16,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:08:16,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437637877] [2019-10-13 21:08:16,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:08:16,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:16,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:08:16,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:08:16,655 INFO L87 Difference]: Start difference. First operand 612 states and 776 transitions. Second operand 8 states. [2019-10-13 21:08:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:16,832 INFO L93 Difference]: Finished difference Result 642 states and 810 transitions. [2019-10-13 21:08:16,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:08:16,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-13 21:08:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:16,836 INFO L225 Difference]: With dead ends: 642 [2019-10-13 21:08:16,836 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:08:16,836 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 21:08:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:08:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2019-10-13 21:08:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-13 21:08:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 797 transitions. [2019-10-13 21:08:16,877 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 797 transitions. Word has length 51 [2019-10-13 21:08:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:16,878 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 797 transitions. [2019-10-13 21:08:16,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:08:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 797 transitions. [2019-10-13 21:08:16,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 21:08:16,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:16,882 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 21:08:16,882 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:16,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:16,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1205634531, now seen corresponding path program 1 times [2019-10-13 21:08:16,883 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:16,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915827763] [2019-10-13 21:08:16,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:16,884 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:16,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:16,969 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 21:08:16,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915827763] [2019-10-13 21:08:16,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:16,970 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:08:16,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305825309] [2019-10-13 21:08:16,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:08:16,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:16,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:08:16,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:08:16,971 INFO L87 Difference]: Start difference. First operand 630 states and 797 transitions. Second operand 8 states. [2019-10-13 21:08:17,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:17,074 INFO L93 Difference]: Finished difference Result 1024 states and 1318 transitions. [2019-10-13 21:08:17,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:08:17,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-10-13 21:08:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:17,079 INFO L225 Difference]: With dead ends: 1024 [2019-10-13 21:08:17,080 INFO L226 Difference]: Without dead ends: 670 [2019-10-13 21:08:17,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:08:17,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-13 21:08:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 651. [2019-10-13 21:08:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-13 21:08:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 835 transitions. [2019-10-13 21:08:17,115 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 835 transitions. Word has length 51 [2019-10-13 21:08:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:17,116 INFO L462 AbstractCegarLoop]: Abstraction has 651 states and 835 transitions. [2019-10-13 21:08:17,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:08:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 835 transitions. [2019-10-13 21:08:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 21:08:17,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:17,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, 1, 1, 1, 1] [2019-10-13 21:08:17,118 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1316245040, now seen corresponding path program 1 times [2019-10-13 21:08:17,119 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:17,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333187350] [2019-10-13 21:08:17,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:17,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:17,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:17,360 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 21:08:17,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333187350] [2019-10-13 21:08:17,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:17,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-13 21:08:17,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439953205] [2019-10-13 21:08:17,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 21:08:17,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 21:08:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:08:17,363 INFO L87 Difference]: Start difference. First operand 651 states and 835 transitions. Second operand 15 states. [2019-10-13 21:08:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:20,694 INFO L93 Difference]: Finished difference Result 1041 states and 1345 transitions. [2019-10-13 21:08:20,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 21:08:20,695 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2019-10-13 21:08:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:20,699 INFO L225 Difference]: With dead ends: 1041 [2019-10-13 21:08:20,700 INFO L226 Difference]: Without dead ends: 794 [2019-10-13 21:08:20,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2019-10-13 21:08:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-10-13 21:08:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 662. [2019-10-13 21:08:20,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-10-13 21:08:20,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 850 transitions. [2019-10-13 21:08:20,740 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 850 transitions. Word has length 52 [2019-10-13 21:08:20,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:20,740 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 850 transitions. [2019-10-13 21:08:20,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 21:08:20,741 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 850 transitions. [2019-10-13 21:08:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 21:08:20,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:20,743 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] [2019-10-13 21:08:20,743 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash 472130064, now seen corresponding path program 1 times [2019-10-13 21:08:20,743 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:20,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901685622] [2019-10-13 21:08:20,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:20,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:20,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:08:20,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901685622] [2019-10-13 21:08:20,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:20,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:08:20,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089858364] [2019-10-13 21:08:20,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:08:20,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:20,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:08:20,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:08:20,855 INFO L87 Difference]: Start difference. First operand 662 states and 850 transitions. Second operand 10 states. [2019-10-13 21:08:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:23,058 INFO L93 Difference]: Finished difference Result 849 states and 1112 transitions. [2019-10-13 21:08:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:08:23,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-10-13 21:08:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:23,064 INFO L225 Difference]: With dead ends: 849 [2019-10-13 21:08:23,064 INFO L226 Difference]: Without dead ends: 833 [2019-10-13 21:08:23,065 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 21:08:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2019-10-13 21:08:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 676. [2019-10-13 21:08:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-10-13 21:08:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 863 transitions. [2019-10-13 21:08:23,104 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 863 transitions. Word has length 52 [2019-10-13 21:08:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:23,105 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 863 transitions. [2019-10-13 21:08:23,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:08:23,105 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 863 transitions. [2019-10-13 21:08:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 21:08:23,107 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:23,107 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] [2019-10-13 21:08:23,107 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1499440053, now seen corresponding path program 1 times [2019-10-13 21:08:23,108 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:23,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413409688] [2019-10-13 21:08:23,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:23,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:23,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:23,171 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 21:08:23,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413409688] [2019-10-13 21:08:23,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:23,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:08:23,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422569168] [2019-10-13 21:08:23,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:08:23,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:23,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:08:23,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:08:23,173 INFO L87 Difference]: Start difference. First operand 676 states and 863 transitions. Second operand 7 states. [2019-10-13 21:08:24,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:24,039 INFO L93 Difference]: Finished difference Result 812 states and 1040 transitions. [2019-10-13 21:08:24,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:08:24,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-10-13 21:08:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:24,049 INFO L225 Difference]: With dead ends: 812 [2019-10-13 21:08:24,050 INFO L226 Difference]: Without dead ends: 714 [2019-10-13 21:08:24,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:08:24,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-13 21:08:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 694. [2019-10-13 21:08:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-13 21:08:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 886 transitions. [2019-10-13 21:08:24,097 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 886 transitions. Word has length 52 [2019-10-13 21:08:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:24,099 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 886 transitions. [2019-10-13 21:08:24,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:08:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 886 transitions. [2019-10-13 21:08:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 21:08:24,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:24,101 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] [2019-10-13 21:08:24,101 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1356160695, now seen corresponding path program 1 times [2019-10-13 21:08:24,102 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:24,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549452494] [2019-10-13 21:08:24,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:24,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:24,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:08:24,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549452494] [2019-10-13 21:08:24,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:24,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:24,151 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563518069] [2019-10-13 21:08:24,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:24,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:24,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:24,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:24,152 INFO L87 Difference]: Start difference. First operand 694 states and 886 transitions. Second operand 3 states. [2019-10-13 21:08:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:24,328 INFO L93 Difference]: Finished difference Result 854 states and 1106 transitions. [2019-10-13 21:08:24,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:24,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-13 21:08:24,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:24,333 INFO L225 Difference]: With dead ends: 854 [2019-10-13 21:08:24,333 INFO L226 Difference]: Without dead ends: 781 [2019-10-13 21:08:24,334 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 21:08:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-13 21:08:24,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 667. [2019-10-13 21:08:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-10-13 21:08:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 865 transitions. [2019-10-13 21:08:24,375 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 865 transitions. Word has length 52 [2019-10-13 21:08:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:24,375 INFO L462 AbstractCegarLoop]: Abstraction has 667 states and 865 transitions. [2019-10-13 21:08:24,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 865 transitions. [2019-10-13 21:08:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 21:08:24,377 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:24,377 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] [2019-10-13 21:08:24,377 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:24,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash 53035812, now seen corresponding path program 1 times [2019-10-13 21:08:24,378 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:24,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086383470] [2019-10-13 21:08:24,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:24,378 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:24,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:24,452 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 21:08:24,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086383470] [2019-10-13 21:08:24,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:24,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:24,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121429030] [2019-10-13 21:08:24,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:24,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:24,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:24,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:24,454 INFO L87 Difference]: Start difference. First operand 667 states and 865 transitions. Second operand 3 states. [2019-10-13 21:08:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:24,570 INFO L93 Difference]: Finished difference Result 978 states and 1267 transitions. [2019-10-13 21:08:24,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:24,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-13 21:08:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:24,574 INFO L225 Difference]: With dead ends: 978 [2019-10-13 21:08:24,574 INFO L226 Difference]: Without dead ends: 661 [2019-10-13 21:08:24,576 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 21:08:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-10-13 21:08:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2019-10-13 21:08:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-13 21:08:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 848 transitions. [2019-10-13 21:08:24,613 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 848 transitions. Word has length 61 [2019-10-13 21:08:24,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:24,613 INFO L462 AbstractCegarLoop]: Abstraction has 661 states and 848 transitions. [2019-10-13 21:08:24,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 848 transitions. [2019-10-13 21:08:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 21:08:24,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:24,615 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 21:08:24,615 INFO L410 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:24,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:24,615 INFO L82 PathProgramCache]: Analyzing trace with hash 195627467, now seen corresponding path program 1 times [2019-10-13 21:08:24,616 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:24,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664079629] [2019-10-13 21:08:24,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:24,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:24,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:24,834 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 21:08:24,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664079629] [2019-10-13 21:08:24,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:24,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 21:08:24,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197588696] [2019-10-13 21:08:24,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 21:08:24,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:24,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 21:08:24,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:08:24,837 INFO L87 Difference]: Start difference. First operand 661 states and 848 transitions. Second operand 11 states. [2019-10-13 21:08:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:25,902 INFO L93 Difference]: Finished difference Result 1020 states and 1331 transitions. [2019-10-13 21:08:25,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:08:25,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-10-13 21:08:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:25,906 INFO L225 Difference]: With dead ends: 1020 [2019-10-13 21:08:25,907 INFO L226 Difference]: Without dead ends: 691 [2019-10-13 21:08:25,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:08:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-13 21:08:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 661. [2019-10-13 21:08:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-10-13 21:08:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 848 transitions. [2019-10-13 21:08:25,946 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 848 transitions. Word has length 54 [2019-10-13 21:08:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:25,946 INFO L462 AbstractCegarLoop]: Abstraction has 661 states and 848 transitions. [2019-10-13 21:08:25,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 21:08:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 848 transitions. [2019-10-13 21:08:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 21:08:25,948 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:25,948 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 21:08:25,949 INFO L410 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:25,949 INFO L82 PathProgramCache]: Analyzing trace with hash 837184011, now seen corresponding path program 1 times [2019-10-13 21:08:25,949 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:25,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187385977] [2019-10-13 21:08:25,949 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:25,950 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:25,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:26,009 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 21:08:26,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187385977] [2019-10-13 21:08:26,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:26,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:26,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565065183] [2019-10-13 21:08:26,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:26,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:26,011 INFO L87 Difference]: Start difference. First operand 661 states and 848 transitions. Second operand 5 states. [2019-10-13 21:08:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:26,515 INFO L93 Difference]: Finished difference Result 728 states and 929 transitions. [2019-10-13 21:08:26,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:08:26,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-13 21:08:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:26,519 INFO L225 Difference]: With dead ends: 728 [2019-10-13 21:08:26,519 INFO L226 Difference]: Without dead ends: 710 [2019-10-13 21:08:26,520 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 21:08:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-10-13 21:08:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 643. [2019-10-13 21:08:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-10-13 21:08:26,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 820 transitions. [2019-10-13 21:08:26,558 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 820 transitions. Word has length 54 [2019-10-13 21:08:26,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:26,559 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 820 transitions. [2019-10-13 21:08:26,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:26,559 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 820 transitions. [2019-10-13 21:08:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:08:26,562 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:26,562 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:26,562 INFO L410 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:26,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:26,563 INFO L82 PathProgramCache]: Analyzing trace with hash -848857517, now seen corresponding path program 1 times [2019-10-13 21:08:26,563 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:26,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47071313] [2019-10-13 21:08:26,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:26,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:26,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:26,655 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 21:08:26,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47071313] [2019-10-13 21:08:26,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:26,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:08:26,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723372765] [2019-10-13 21:08:26,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:08:26,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:26,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:08:26,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:08:26,661 INFO L87 Difference]: Start difference. First operand 643 states and 820 transitions. Second operand 8 states. [2019-10-13 21:08:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:26,750 INFO L93 Difference]: Finished difference Result 656 states and 832 transitions. [2019-10-13 21:08:26,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:08:26,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-10-13 21:08:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:26,755 INFO L225 Difference]: With dead ends: 656 [2019-10-13 21:08:26,756 INFO L226 Difference]: Without dead ends: 628 [2019-10-13 21:08:26,758 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 21:08:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-13 21:08:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-10-13 21:08:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-13 21:08:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 801 transitions. [2019-10-13 21:08:26,805 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 801 transitions. Word has length 55 [2019-10-13 21:08:26,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:26,806 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 801 transitions. [2019-10-13 21:08:26,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:08:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 801 transitions. [2019-10-13 21:08:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 21:08:26,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:26,814 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] [2019-10-13 21:08:26,814 INFO L410 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:26,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:26,815 INFO L82 PathProgramCache]: Analyzing trace with hash 682290104, now seen corresponding path program 1 times [2019-10-13 21:08:26,815 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:26,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711469517] [2019-10-13 21:08:26,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:26,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:26,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:26,900 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 21:08:26,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711469517] [2019-10-13 21:08:26,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:26,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:08:26,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236403625] [2019-10-13 21:08:26,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:08:26,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:26,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:08:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:08:26,903 INFO L87 Difference]: Start difference. First operand 628 states and 801 transitions. Second operand 8 states. [2019-10-13 21:08:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:27,085 INFO L93 Difference]: Finished difference Result 651 states and 824 transitions. [2019-10-13 21:08:27,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:08:27,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-10-13 21:08:27,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:27,088 INFO L225 Difference]: With dead ends: 651 [2019-10-13 21:08:27,089 INFO L226 Difference]: Without dead ends: 623 [2019-10-13 21:08:27,090 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 21:08:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-13 21:08:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-13 21:08:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-13 21:08:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 793 transitions. [2019-10-13 21:08:27,126 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 793 transitions. Word has length 56 [2019-10-13 21:08:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:27,127 INFO L462 AbstractCegarLoop]: Abstraction has 623 states and 793 transitions. [2019-10-13 21:08:27,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:08:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 793 transitions. [2019-10-13 21:08:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 21:08:27,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:27,130 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 21:08:27,130 INFO L410 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:27,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:27,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1988865588, now seen corresponding path program 1 times [2019-10-13 21:08:27,132 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:27,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583611600] [2019-10-13 21:08:27,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:27,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:27,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:27,268 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 21:08:27,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583611600] [2019-10-13 21:08:27,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:27,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:27,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979808607] [2019-10-13 21:08:27,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:27,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:27,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:27,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:27,270 INFO L87 Difference]: Start difference. First operand 623 states and 793 transitions. Second operand 5 states. [2019-10-13 21:08:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:27,316 INFO L93 Difference]: Finished difference Result 882 states and 1130 transitions. [2019-10-13 21:08:27,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:08:27,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-13 21:08:27,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:27,320 INFO L225 Difference]: With dead ends: 882 [2019-10-13 21:08:27,320 INFO L226 Difference]: Without dead ends: 565 [2019-10-13 21:08:27,322 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 21:08:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-10-13 21:08:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2019-10-13 21:08:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-13 21:08:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 709 transitions. [2019-10-13 21:08:27,357 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 709 transitions. Word has length 64 [2019-10-13 21:08:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:27,357 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 709 transitions. [2019-10-13 21:08:27,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 709 transitions. [2019-10-13 21:08:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 21:08:27,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:27,359 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 21:08:27,360 INFO L410 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:27,360 INFO L82 PathProgramCache]: Analyzing trace with hash 315715581, now seen corresponding path program 1 times [2019-10-13 21:08:27,360 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:27,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937571643] [2019-10-13 21:08:27,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:27,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:27,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:27,420 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 21:08:27,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937571643] [2019-10-13 21:08:27,421 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:27,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:08:27,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103296075] [2019-10-13 21:08:27,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:08:27,422 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:27,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:08:27,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:08:27,422 INFO L87 Difference]: Start difference. First operand 565 states and 709 transitions. Second operand 6 states. [2019-10-13 21:08:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:27,496 INFO L93 Difference]: Finished difference Result 584 states and 728 transitions. [2019-10-13 21:08:27,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:08:27,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-13 21:08:27,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:27,500 INFO L225 Difference]: With dead ends: 584 [2019-10-13 21:08:27,500 INFO L226 Difference]: Without dead ends: 560 [2019-10-13 21:08:27,500 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 21:08:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-13 21:08:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-10-13 21:08:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-10-13 21:08:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 703 transitions. [2019-10-13 21:08:27,548 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 703 transitions. Word has length 60 [2019-10-13 21:08:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:27,548 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 703 transitions. [2019-10-13 21:08:27,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:08:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 703 transitions. [2019-10-13 21:08:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-13 21:08:27,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:27,550 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:27,550 INFO L410 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:27,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 365447091, now seen corresponding path program 1 times [2019-10-13 21:08:27,551 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:27,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107218717] [2019-10-13 21:08:27,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:27,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:27,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:27,615 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 21:08:27,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107218717] [2019-10-13 21:08:27,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:27,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:27,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537101654] [2019-10-13 21:08:27,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:27,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:27,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:27,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:27,617 INFO L87 Difference]: Start difference. First operand 560 states and 703 transitions. Second operand 5 states. [2019-10-13 21:08:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:27,921 INFO L93 Difference]: Finished difference Result 819 states and 1033 transitions. [2019-10-13 21:08:27,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:08:27,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-13 21:08:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:27,927 INFO L225 Difference]: With dead ends: 819 [2019-10-13 21:08:27,927 INFO L226 Difference]: Without dead ends: 560 [2019-10-13 21:08:27,928 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 21:08:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-10-13 21:08:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2019-10-13 21:08:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-10-13 21:08:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 701 transitions. [2019-10-13 21:08:27,972 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 701 transitions. Word has length 68 [2019-10-13 21:08:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:27,972 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 701 transitions. [2019-10-13 21:08:27,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 701 transitions. [2019-10-13 21:08:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-13 21:08:27,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:27,977 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] [2019-10-13 21:08:27,977 INFO L410 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash -701574740, now seen corresponding path program 1 times [2019-10-13 21:08:27,978 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:27,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433387596] [2019-10-13 21:08:27,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:27,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:27,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:28,054 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 21:08:28,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433387596] [2019-10-13 21:08:28,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:28,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:08:28,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324826709] [2019-10-13 21:08:28,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:08:28,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:28,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:08:28,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:08:28,058 INFO L87 Difference]: Start difference. First operand 560 states and 701 transitions. Second operand 9 states. [2019-10-13 21:08:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:28,281 INFO L93 Difference]: Finished difference Result 589 states and 732 transitions. [2019-10-13 21:08:28,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:08:28,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-10-13 21:08:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:28,285 INFO L225 Difference]: With dead ends: 589 [2019-10-13 21:08:28,285 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 21:08:28,286 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 21:08:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 21:08:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-13 21:08:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-13 21:08:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 693 transitions. [2019-10-13 21:08:28,317 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 693 transitions. Word has length 61 [2019-10-13 21:08:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:28,318 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 693 transitions. [2019-10-13 21:08:28,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:08:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 693 transitions. [2019-10-13 21:08:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 21:08:28,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:28,320 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 21:08:28,320 INFO L410 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1376834024, now seen corresponding path program 1 times [2019-10-13 21:08:28,320 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:28,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305864523] [2019-10-13 21:08:28,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:28,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:28,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:28,373 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 21:08:28,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305864523] [2019-10-13 21:08:28,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:28,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:28,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106048463] [2019-10-13 21:08:28,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:28,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:28,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:28,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:28,375 INFO L87 Difference]: Start difference. First operand 555 states and 693 transitions. Second operand 5 states. [2019-10-13 21:08:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:28,417 INFO L93 Difference]: Finished difference Result 678 states and 838 transitions. [2019-10-13 21:08:28,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:08:28,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-13 21:08:28,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:28,421 INFO L225 Difference]: With dead ends: 678 [2019-10-13 21:08:28,421 INFO L226 Difference]: Without dead ends: 561 [2019-10-13 21:08:28,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 21:08:28,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-13 21:08:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-13 21:08:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-13 21:08:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 697 transitions. [2019-10-13 21:08:28,462 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 697 transitions. Word has length 63 [2019-10-13 21:08:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:28,462 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 697 transitions. [2019-10-13 21:08:28,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 697 transitions. [2019-10-13 21:08:28,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 21:08:28,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:28,464 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 21:08:28,464 INFO L410 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:28,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:28,465 INFO L82 PathProgramCache]: Analyzing trace with hash 902963543, now seen corresponding path program 1 times [2019-10-13 21:08:28,465 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:28,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368936638] [2019-10-13 21:08:28,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:28,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:28,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:28,569 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 21:08:28,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368936638] [2019-10-13 21:08:28,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:28,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:08:28,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131831188] [2019-10-13 21:08:28,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:08:28,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:28,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:08:28,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:08:28,572 INFO L87 Difference]: Start difference. First operand 559 states and 697 transitions. Second operand 9 states. [2019-10-13 21:08:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:28,668 INFO L93 Difference]: Finished difference Result 696 states and 856 transitions. [2019-10-13 21:08:28,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:08:28,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-10-13 21:08:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:28,671 INFO L225 Difference]: With dead ends: 696 [2019-10-13 21:08:28,671 INFO L226 Difference]: Without dead ends: 561 [2019-10-13 21:08:28,672 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 21:08:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-13 21:08:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-13 21:08:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-13 21:08:28,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 696 transitions. [2019-10-13 21:08:28,708 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 696 transitions. Word has length 63 [2019-10-13 21:08:28,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:28,708 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 696 transitions. [2019-10-13 21:08:28,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:08:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 696 transitions. [2019-10-13 21:08:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 21:08:28,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:28,711 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] [2019-10-13 21:08:28,711 INFO L410 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2118524936, now seen corresponding path program 1 times [2019-10-13 21:08:28,712 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:28,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452778166] [2019-10-13 21:08:28,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:28,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:28,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:28,796 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 21:08:28,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452778166] [2019-10-13 21:08:28,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:28,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:08:28,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694992953] [2019-10-13 21:08:28,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:08:28,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:28,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:08:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:08:28,798 INFO L87 Difference]: Start difference. First operand 559 states and 696 transitions. Second operand 9 states. [2019-10-13 21:08:28,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:28,988 INFO L93 Difference]: Finished difference Result 588 states and 727 transitions. [2019-10-13 21:08:28,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:08:28,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-10-13 21:08:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:28,991 INFO L225 Difference]: With dead ends: 588 [2019-10-13 21:08:28,991 INFO L226 Difference]: Without dead ends: 553 [2019-10-13 21:08:28,994 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 21:08:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-10-13 21:08:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2019-10-13 21:08:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-13 21:08:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 687 transitions. [2019-10-13 21:08:29,023 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 687 transitions. Word has length 62 [2019-10-13 21:08:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:29,024 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 687 transitions. [2019-10-13 21:08:29,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:08:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 687 transitions. [2019-10-13 21:08:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 21:08:29,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:29,026 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:29,026 INFO L410 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:29,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash -129702502, now seen corresponding path program 1 times [2019-10-13 21:08:29,027 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:29,027 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612024183] [2019-10-13 21:08:29,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:29,027 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:29,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:29,111 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 21:08:29,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612024183] [2019-10-13 21:08:29,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:29,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:08:29,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068895764] [2019-10-13 21:08:29,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:08:29,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:08:29,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:08:29,114 INFO L87 Difference]: Start difference. First operand 553 states and 687 transitions. Second operand 9 states. [2019-10-13 21:08:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:29,293 INFO L93 Difference]: Finished difference Result 582 states and 718 transitions. [2019-10-13 21:08:29,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:08:29,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-10-13 21:08:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:29,296 INFO L225 Difference]: With dead ends: 582 [2019-10-13 21:08:29,296 INFO L226 Difference]: Without dead ends: 548 [2019-10-13 21:08:29,296 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 21:08:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-13 21:08:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-10-13 21:08:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-10-13 21:08:29,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 679 transitions. [2019-10-13 21:08:29,326 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 679 transitions. Word has length 62 [2019-10-13 21:08:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:29,327 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 679 transitions. [2019-10-13 21:08:29,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:08:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 679 transitions. [2019-10-13 21:08:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 21:08:29,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:29,329 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] [2019-10-13 21:08:29,329 INFO L410 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:29,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:29,329 INFO L82 PathProgramCache]: Analyzing trace with hash -905491201, now seen corresponding path program 1 times [2019-10-13 21:08:29,330 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:29,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385419789] [2019-10-13 21:08:29,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:29,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:29,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:29,415 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 21:08:29,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385419789] [2019-10-13 21:08:29,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:29,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:08:29,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706461688] [2019-10-13 21:08:29,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:08:29,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:29,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:08:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:08:29,418 INFO L87 Difference]: Start difference. First operand 548 states and 679 transitions. Second operand 8 states. [2019-10-13 21:08:29,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:29,602 INFO L93 Difference]: Finished difference Result 565 states and 696 transitions. [2019-10-13 21:08:29,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:08:29,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2019-10-13 21:08:29,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:29,606 INFO L225 Difference]: With dead ends: 565 [2019-10-13 21:08:29,607 INFO L226 Difference]: Without dead ends: 533 [2019-10-13 21:08:29,607 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 21:08:29,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-10-13 21:08:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2019-10-13 21:08:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-13 21:08:29,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 659 transitions. [2019-10-13 21:08:29,654 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 659 transitions. Word has length 62 [2019-10-13 21:08:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:29,655 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 659 transitions. [2019-10-13 21:08:29,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:08:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 659 transitions. [2019-10-13 21:08:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-13 21:08:29,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:29,657 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 21:08:29,657 INFO L410 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1235234569, now seen corresponding path program 1 times [2019-10-13 21:08:29,658 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:29,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883957372] [2019-10-13 21:08:29,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:29,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:29,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:29,775 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 21:08:29,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883957372] [2019-10-13 21:08:29,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:29,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:08:29,778 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683102764] [2019-10-13 21:08:29,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:08:29,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:08:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:08:29,782 INFO L87 Difference]: Start difference. First operand 533 states and 659 transitions. Second operand 6 states. [2019-10-13 21:08:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:29,873 INFO L93 Difference]: Finished difference Result 775 states and 967 transitions. [2019-10-13 21:08:29,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:08:29,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-10-13 21:08:29,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:29,877 INFO L225 Difference]: With dead ends: 775 [2019-10-13 21:08:29,877 INFO L226 Difference]: Without dead ends: 549 [2019-10-13 21:08:29,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:08:29,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-13 21:08:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 533. [2019-10-13 21:08:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-13 21:08:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 657 transitions. [2019-10-13 21:08:29,960 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 657 transitions. Word has length 71 [2019-10-13 21:08:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:29,961 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 657 transitions. [2019-10-13 21:08:29,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:08:29,961 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 657 transitions. [2019-10-13 21:08:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 21:08:29,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:29,966 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] [2019-10-13 21:08:29,966 INFO L410 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:29,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:29,967 INFO L82 PathProgramCache]: Analyzing trace with hash -981702428, now seen corresponding path program 1 times [2019-10-13 21:08:29,967 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:29,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051808308] [2019-10-13 21:08:29,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:29,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:29,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:30,035 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 21:08:30,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051808308] [2019-10-13 21:08:30,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:30,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:08:30,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432672021] [2019-10-13 21:08:30,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:08:30,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:30,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:08:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:08:30,040 INFO L87 Difference]: Start difference. First operand 533 states and 657 transitions. Second operand 3 states. [2019-10-13 21:08:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:30,100 INFO L93 Difference]: Finished difference Result 890 states and 1105 transitions. [2019-10-13 21:08:30,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:08:30,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-13 21:08:30,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:30,105 INFO L225 Difference]: With dead ends: 890 [2019-10-13 21:08:30,105 INFO L226 Difference]: Without dead ends: 637 [2019-10-13 21:08:30,107 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 21:08:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-13 21:08:30,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 607. [2019-10-13 21:08:30,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-13 21:08:30,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 751 transitions. [2019-10-13 21:08:30,158 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 751 transitions. Word has length 73 [2019-10-13 21:08:30,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:30,160 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 751 transitions. [2019-10-13 21:08:30,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:08:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 751 transitions. [2019-10-13 21:08:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 21:08:30,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:30,163 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] [2019-10-13 21:08:30,164 INFO L410 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:30,164 INFO L82 PathProgramCache]: Analyzing trace with hash -573109325, now seen corresponding path program 1 times [2019-10-13 21:08:30,164 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:30,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339975908] [2019-10-13 21:08:30,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:30,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:30,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:30,276 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 21:08:30,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339975908] [2019-10-13 21:08:30,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:30,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:08:30,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991593438] [2019-10-13 21:08:30,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:08:30,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:30,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:08:30,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:08:30,279 INFO L87 Difference]: Start difference. First operand 607 states and 751 transitions. Second operand 9 states. [2019-10-13 21:08:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:30,465 INFO L93 Difference]: Finished difference Result 636 states and 782 transitions. [2019-10-13 21:08:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:08:30,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-10-13 21:08:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:30,468 INFO L225 Difference]: With dead ends: 636 [2019-10-13 21:08:30,468 INFO L226 Difference]: Without dead ends: 561 [2019-10-13 21:08:30,468 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 21:08:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-13 21:08:30,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-13 21:08:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-13 21:08:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 694 transitions. [2019-10-13 21:08:30,499 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 694 transitions. Word has length 66 [2019-10-13 21:08:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:30,500 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 694 transitions. [2019-10-13 21:08:30,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:08:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 694 transitions. [2019-10-13 21:08:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 21:08:30,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:30,502 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] [2019-10-13 21:08:30,502 INFO L410 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:30,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:30,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1657933026, now seen corresponding path program 1 times [2019-10-13 21:08:30,502 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:30,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938275594] [2019-10-13 21:08:30,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:30,503 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:30,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:30,585 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 21:08:30,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938275594] [2019-10-13 21:08:30,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:30,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:08:30,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562313982] [2019-10-13 21:08:30,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:08:30,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:30,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:08:30,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:08:30,587 INFO L87 Difference]: Start difference. First operand 561 states and 694 transitions. Second operand 4 states. [2019-10-13 21:08:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:30,841 INFO L93 Difference]: Finished difference Result 1273 states and 1559 transitions. [2019-10-13 21:08:30,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:08:30,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-10-13 21:08:30,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:30,846 INFO L225 Difference]: With dead ends: 1273 [2019-10-13 21:08:30,847 INFO L226 Difference]: Without dead ends: 765 [2019-10-13 21:08:30,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 21:08:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-10-13 21:08:30,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 655. [2019-10-13 21:08:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-13 21:08:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 800 transitions. [2019-10-13 21:08:30,906 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 800 transitions. Word has length 82 [2019-10-13 21:08:30,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:30,906 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 800 transitions. [2019-10-13 21:08:30,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:08:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 800 transitions. [2019-10-13 21:08:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-13 21:08:30,910 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:30,910 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] [2019-10-13 21:08:30,910 INFO L410 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:30,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1097233248, now seen corresponding path program 1 times [2019-10-13 21:08:30,911 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:30,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790866337] [2019-10-13 21:08:30,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:30,912 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:30,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:31,064 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 21:08:31,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790866337] [2019-10-13 21:08:31,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:31,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:08:31,065 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039291222] [2019-10-13 21:08:31,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:08:31,066 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:31,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:08:31,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:08:31,067 INFO L87 Difference]: Start difference. First operand 655 states and 800 transitions. Second operand 7 states. [2019-10-13 21:08:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:31,811 INFO L93 Difference]: Finished difference Result 959 states and 1175 transitions. [2019-10-13 21:08:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:08:31,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-13 21:08:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:31,814 INFO L225 Difference]: With dead ends: 959 [2019-10-13 21:08:31,814 INFO L226 Difference]: Without dead ends: 650 [2019-10-13 21:08:31,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:08:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-13 21:08:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 639. [2019-10-13 21:08:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-13 21:08:31,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 772 transitions. [2019-10-13 21:08:31,859 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 772 transitions. Word has length 82 [2019-10-13 21:08:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:31,859 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 772 transitions. [2019-10-13 21:08:31,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:08:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 772 transitions. [2019-10-13 21:08:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 21:08:31,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:31,861 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] [2019-10-13 21:08:31,861 INFO L410 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:31,862 INFO L82 PathProgramCache]: Analyzing trace with hash -501162190, now seen corresponding path program 1 times [2019-10-13 21:08:31,862 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:31,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963198223] [2019-10-13 21:08:31,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:31,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:31,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:31,924 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 21:08:31,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963198223] [2019-10-13 21:08:31,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:31,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:31,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581766434] [2019-10-13 21:08:31,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:31,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:31,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:31,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:31,926 INFO L87 Difference]: Start difference. First operand 639 states and 772 transitions. Second operand 5 states. [2019-10-13 21:08:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:31,991 INFO L93 Difference]: Finished difference Result 825 states and 989 transitions. [2019-10-13 21:08:31,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:08:31,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-10-13 21:08:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:31,994 INFO L225 Difference]: With dead ends: 825 [2019-10-13 21:08:31,994 INFO L226 Difference]: Without dead ends: 637 [2019-10-13 21:08:31,995 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 21:08:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-13 21:08:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2019-10-13 21:08:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-10-13 21:08:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 768 transitions. [2019-10-13 21:08:32,050 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 768 transitions. Word has length 76 [2019-10-13 21:08:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:32,050 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 768 transitions. [2019-10-13 21:08:32,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 768 transitions. [2019-10-13 21:08:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 21:08:32,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:32,053 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] [2019-10-13 21:08:32,053 INFO L410 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:32,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:32,053 INFO L82 PathProgramCache]: Analyzing trace with hash 211753811, now seen corresponding path program 1 times [2019-10-13 21:08:32,053 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:32,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622507547] [2019-10-13 21:08:32,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:32,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:32,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:32,163 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 21:08:32,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622507547] [2019-10-13 21:08:32,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:32,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:08:32,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191302672] [2019-10-13 21:08:32,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:08:32,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:32,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:08:32,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:08:32,165 INFO L87 Difference]: Start difference. First operand 637 states and 768 transitions. Second operand 9 states. [2019-10-13 21:08:32,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:32,257 INFO L93 Difference]: Finished difference Result 651 states and 782 transitions. [2019-10-13 21:08:32,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:08:32,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2019-10-13 21:08:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:32,266 INFO L225 Difference]: With dead ends: 651 [2019-10-13 21:08:32,267 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 21:08:32,268 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 21:08:32,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 21:08:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 587. [2019-10-13 21:08:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-13 21:08:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 703 transitions. [2019-10-13 21:08:32,312 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 703 transitions. Word has length 76 [2019-10-13 21:08:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:32,312 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 703 transitions. [2019-10-13 21:08:32,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:08:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 703 transitions. [2019-10-13 21:08:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 21:08:32,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:32,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:32,315 INFO L410 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:32,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1448627846, now seen corresponding path program 1 times [2019-10-13 21:08:32,316 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:32,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734546724] [2019-10-13 21:08:32,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:32,316 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:32,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:32,410 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 21:08:32,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734546724] [2019-10-13 21:08:32,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:32,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:08:32,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906760005] [2019-10-13 21:08:32,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:08:32,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:32,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:08:32,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:08:32,413 INFO L87 Difference]: Start difference. First operand 587 states and 703 transitions. Second operand 6 states. [2019-10-13 21:08:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:32,488 INFO L93 Difference]: Finished difference Result 902 states and 1114 transitions. [2019-10-13 21:08:32,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:08:32,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-13 21:08:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:32,491 INFO L225 Difference]: With dead ends: 902 [2019-10-13 21:08:32,491 INFO L226 Difference]: Without dead ends: 648 [2019-10-13 21:08:32,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:08:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-13 21:08:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 553. [2019-10-13 21:08:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-10-13 21:08:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 659 transitions. [2019-10-13 21:08:32,533 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 659 transitions. Word has length 83 [2019-10-13 21:08:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:32,533 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 659 transitions. [2019-10-13 21:08:32,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:08:32,534 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 659 transitions. [2019-10-13 21:08:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 21:08:32,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:32,536 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 21:08:32,536 INFO L410 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:32,537 INFO L82 PathProgramCache]: Analyzing trace with hash -433541091, now seen corresponding path program 1 times [2019-10-13 21:08:32,537 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:32,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281743028] [2019-10-13 21:08:32,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:32,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:32,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:32,588 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 21:08:32,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281743028] [2019-10-13 21:08:32,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:32,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:32,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437677679] [2019-10-13 21:08:32,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:32,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:32,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:32,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:32,590 INFO L87 Difference]: Start difference. First operand 553 states and 659 transitions. Second operand 5 states. [2019-10-13 21:08:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:33,156 INFO L93 Difference]: Finished difference Result 1005 states and 1180 transitions. [2019-10-13 21:08:33,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:08:33,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-13 21:08:33,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:33,162 INFO L225 Difference]: With dead ends: 1005 [2019-10-13 21:08:33,162 INFO L226 Difference]: Without dead ends: 651 [2019-10-13 21:08:33,164 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 21:08:33,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-13 21:08:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 628. [2019-10-13 21:08:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-10-13 21:08:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 735 transitions. [2019-10-13 21:08:33,233 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 735 transitions. Word has length 78 [2019-10-13 21:08:33,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:33,235 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 735 transitions. [2019-10-13 21:08:33,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 735 transitions. [2019-10-13 21:08:33,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-13 21:08:33,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:33,239 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] [2019-10-13 21:08:33,239 INFO L410 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:33,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1570342342, now seen corresponding path program 1 times [2019-10-13 21:08:33,240 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:33,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501022658] [2019-10-13 21:08:33,241 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:33,241 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:33,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:33,344 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 21:08:33,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501022658] [2019-10-13 21:08:33,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:33,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:08:33,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344251502] [2019-10-13 21:08:33,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:08:33,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:33,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:08:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:08:33,347 INFO L87 Difference]: Start difference. First operand 628 states and 735 transitions. Second operand 9 states. [2019-10-13 21:08:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:33,522 INFO L93 Difference]: Finished difference Result 630 states and 736 transitions. [2019-10-13 21:08:33,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:08:33,522 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2019-10-13 21:08:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:33,524 INFO L225 Difference]: With dead ends: 630 [2019-10-13 21:08:33,525 INFO L226 Difference]: Without dead ends: 449 [2019-10-13 21:08:33,532 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 21:08:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-10-13 21:08:33,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-10-13 21:08:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-13 21:08:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 533 transitions. [2019-10-13 21:08:33,568 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 533 transitions. Word has length 79 [2019-10-13 21:08:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:33,569 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 533 transitions. [2019-10-13 21:08:33,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:08:33,569 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 533 transitions. [2019-10-13 21:08:33,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:08:33,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:33,570 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:33,571 INFO L410 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:33,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:33,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1336030567, now seen corresponding path program 1 times [2019-10-13 21:08:33,571 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:33,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873209989] [2019-10-13 21:08:33,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:33,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:33,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:33,662 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 21:08:33,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873209989] [2019-10-13 21:08:33,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:33,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:08:33,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415461705] [2019-10-13 21:08:33,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:08:33,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:33,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:08:33,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:08:33,667 INFO L87 Difference]: Start difference. First operand 449 states and 533 transitions. Second operand 9 states. [2019-10-13 21:08:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:33,808 INFO L93 Difference]: Finished difference Result 470 states and 554 transitions. [2019-10-13 21:08:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:08:33,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-10-13 21:08:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:33,810 INFO L225 Difference]: With dead ends: 470 [2019-10-13 21:08:33,810 INFO L226 Difference]: Without dead ends: 449 [2019-10-13 21:08:33,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:08:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-10-13 21:08:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-10-13 21:08:33,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-13 21:08:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 532 transitions. [2019-10-13 21:08:33,844 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 532 transitions. Word has length 88 [2019-10-13 21:08:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:33,845 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 532 transitions. [2019-10-13 21:08:33,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:08:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 532 transitions. [2019-10-13 21:08:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:08:33,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:33,847 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:33,847 INFO L410 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:33,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:33,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2100668997, now seen corresponding path program 1 times [2019-10-13 21:08:33,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:33,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254714933] [2019-10-13 21:08:33,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:33,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:33,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:33,927 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 21:08:33,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254714933] [2019-10-13 21:08:33,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:33,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:08:33,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923602789] [2019-10-13 21:08:33,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:08:33,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:08:33,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:08:33,930 INFO L87 Difference]: Start difference. First operand 449 states and 532 transitions. Second operand 7 states. [2019-10-13 21:08:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:34,131 INFO L93 Difference]: Finished difference Result 847 states and 1007 transitions. [2019-10-13 21:08:34,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:08:34,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-10-13 21:08:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:34,143 INFO L225 Difference]: With dead ends: 847 [2019-10-13 21:08:34,144 INFO L226 Difference]: Without dead ends: 792 [2019-10-13 21:08:34,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:08:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-10-13 21:08:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 370. [2019-10-13 21:08:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-13 21:08:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 431 transitions. [2019-10-13 21:08:34,185 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 431 transitions. Word has length 99 [2019-10-13 21:08:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:34,185 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 431 transitions. [2019-10-13 21:08:34,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:08:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 431 transitions. [2019-10-13 21:08:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 21:08:34,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:34,188 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:34,189 INFO L410 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:34,189 INFO L82 PathProgramCache]: Analyzing trace with hash -289766285, now seen corresponding path program 1 times [2019-10-13 21:08:34,189 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:34,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46142251] [2019-10-13 21:08:34,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:34,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:34,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:34,347 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 21:08:34,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46142251] [2019-10-13 21:08:34,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:34,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 21:08:34,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599581582] [2019-10-13 21:08:34,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 21:08:34,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:34,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 21:08:34,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:08:34,349 INFO L87 Difference]: Start difference. First operand 370 states and 431 transitions. Second operand 11 states. [2019-10-13 21:08:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:34,478 INFO L93 Difference]: Finished difference Result 515 states and 603 transitions. [2019-10-13 21:08:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:08:34,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 104 [2019-10-13 21:08:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:34,480 INFO L225 Difference]: With dead ends: 515 [2019-10-13 21:08:34,480 INFO L226 Difference]: Without dead ends: 366 [2019-10-13 21:08:34,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:08:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-10-13 21:08:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 353. [2019-10-13 21:08:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-10-13 21:08:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 408 transitions. [2019-10-13 21:08:34,511 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 408 transitions. Word has length 104 [2019-10-13 21:08:34,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:34,511 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 408 transitions. [2019-10-13 21:08:34,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 21:08:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 408 transitions. [2019-10-13 21:08:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:08:34,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:34,513 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 21:08:34,513 INFO L410 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:34,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:34,514 INFO L82 PathProgramCache]: Analyzing trace with hash -211623252, now seen corresponding path program 1 times [2019-10-13 21:08:34,514 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:34,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724024353] [2019-10-13 21:08:34,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:34,514 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:34,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 21:08:34,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724024353] [2019-10-13 21:08:34,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:34,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:08:34,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860557481] [2019-10-13 21:08:34,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:08:34,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:34,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:08:34,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:08:34,594 INFO L87 Difference]: Start difference. First operand 353 states and 408 transitions. Second operand 6 states. [2019-10-13 21:08:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:34,642 INFO L93 Difference]: Finished difference Result 381 states and 434 transitions. [2019-10-13 21:08:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:08:34,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-10-13 21:08:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:34,644 INFO L225 Difference]: With dead ends: 381 [2019-10-13 21:08:34,644 INFO L226 Difference]: Without dead ends: 305 [2019-10-13 21:08:34,645 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 21:08:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-10-13 21:08:34,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 243. [2019-10-13 21:08:34,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-10-13 21:08:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 268 transitions. [2019-10-13 21:08:34,664 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 268 transitions. Word has length 113 [2019-10-13 21:08:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:34,665 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 268 transitions. [2019-10-13 21:08:34,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:08:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 268 transitions. [2019-10-13 21:08:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 21:08:34,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:34,667 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 21:08:34,667 INFO L410 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:34,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1015672895, now seen corresponding path program 1 times [2019-10-13 21:08:34,668 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:34,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583957306] [2019-10-13 21:08:34,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:34,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:34,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 21:08:34,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583957306] [2019-10-13 21:08:34,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:34,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:08:34,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5489213] [2019-10-13 21:08:34,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:08:34,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:34,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:08:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:08:34,774 INFO L87 Difference]: Start difference. First operand 243 states and 268 transitions. Second operand 9 states. [2019-10-13 21:08:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:34,879 INFO L93 Difference]: Finished difference Result 316 states and 355 transitions. [2019-10-13 21:08:34,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:08:34,879 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-10-13 21:08:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:34,881 INFO L225 Difference]: With dead ends: 316 [2019-10-13 21:08:34,881 INFO L226 Difference]: Without dead ends: 287 [2019-10-13 21:08:34,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 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 21:08:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-13 21:08:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-10-13 21:08:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-13 21:08:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 293 transitions. [2019-10-13 21:08:34,903 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 293 transitions. Word has length 134 [2019-10-13 21:08:34,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:34,903 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 293 transitions. [2019-10-13 21:08:34,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:08:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 293 transitions. [2019-10-13 21:08:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:08:34,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:34,905 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2019-10-13 21:08:34,905 INFO L410 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:34,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:34,906 INFO L82 PathProgramCache]: Analyzing trace with hash 14849890, now seen corresponding path program 1 times [2019-10-13 21:08:34,906 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:34,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586146900] [2019-10-13 21:08:34,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:34,906 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:34,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-13 21:08:35,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586146900] [2019-10-13 21:08:35,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:35,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-13 21:08:35,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855143320] [2019-10-13 21:08:35,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 21:08:35,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:35,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 21:08:35,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:08:35,102 INFO L87 Difference]: Start difference. First operand 263 states and 293 transitions. Second operand 15 states. [2019-10-13 21:08:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:35,287 INFO L93 Difference]: Finished difference Result 368 states and 412 transitions. [2019-10-13 21:08:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:08:35,288 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 135 [2019-10-13 21:08:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:35,289 INFO L225 Difference]: With dead ends: 368 [2019-10-13 21:08:35,290 INFO L226 Difference]: Without dead ends: 271 [2019-10-13 21:08:35,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:08:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-13 21:08:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 263. [2019-10-13 21:08:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-13 21:08:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-10-13 21:08:35,316 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 135 [2019-10-13 21:08:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:35,316 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-10-13 21:08:35,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 21:08:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-10-13 21:08:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:08:35,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:35,318 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:35,318 INFO L410 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash 709369442, now seen corresponding path program 1 times [2019-10-13 21:08:35,319 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:35,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30771879] [2019-10-13 21:08:35,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:35,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:35,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:08:35,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30771879] [2019-10-13 21:08:35,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:35,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:08:35,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362021494] [2019-10-13 21:08:35,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:08:35,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:35,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:08:35,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:08:35,388 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 5 states. [2019-10-13 21:08:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:35,431 INFO L93 Difference]: Finished difference Result 305 states and 339 transitions. [2019-10-13 21:08:35,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:08:35,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-13 21:08:35,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:35,432 INFO L225 Difference]: With dead ends: 305 [2019-10-13 21:08:35,433 INFO L226 Difference]: Without dead ends: 276 [2019-10-13 21:08:35,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 21:08:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-10-13 21:08:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 263. [2019-10-13 21:08:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-13 21:08:35,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-10-13 21:08:35,453 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 143 [2019-10-13 21:08:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:35,454 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-10-13 21:08:35,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:08:35,454 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-10-13 21:08:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:08:35,455 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:35,455 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:35,456 INFO L410 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1897304323, now seen corresponding path program 1 times [2019-10-13 21:08:35,456 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:35,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631061054] [2019-10-13 21:08:35,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:35,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:35,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:08:35,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631061054] [2019-10-13 21:08:35,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:35,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:08:35,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247351209] [2019-10-13 21:08:35,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:08:35,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:35,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:08:35,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:08:35,543 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 6 states. [2019-10-13 21:08:35,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:08:35,592 INFO L93 Difference]: Finished difference Result 357 states and 400 transitions. [2019-10-13 21:08:35,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:08:35,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:08:35,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:08:35,595 INFO L225 Difference]: With dead ends: 357 [2019-10-13 21:08:35,595 INFO L226 Difference]: Without dead ends: 269 [2019-10-13 21:08:35,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 21:08:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-13 21:08:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2019-10-13 21:08:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-13 21:08:35,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2019-10-13 21:08:35,622 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 144 [2019-10-13 21:08:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:08:35,623 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2019-10-13 21:08:35,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:08:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2019-10-13 21:08:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:08:35,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:08:35,625 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:08:35,625 INFO L410 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:08:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:08:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1361167968, now seen corresponding path program 1 times [2019-10-13 21:08:35,626 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:08:35,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297650618] [2019-10-13 21:08:35,626 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:35,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:08:35,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:08:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:08:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:08:35,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297650618] [2019-10-13 21:08:35,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:08:35,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-13 21:08:35,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409883432] [2019-10-13 21:08:35,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 21:08:35,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:08:35,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 21:08:35,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:08:35,820 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand 14 states.