java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:39,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:39,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:39,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:39,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:39,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:39,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:39,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:39,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:39,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:39,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:39,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:39,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:39,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:39,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:39,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:39,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:39,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:39,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:39,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:39,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:39,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:39,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:39,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:39,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:39,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:39,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:39,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:39,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:39,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:39,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:39,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:39,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:39,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:39,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:39,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:39,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:39,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:39,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:39,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:39,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:39,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:26:39,220 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:39,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:39,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:39,223 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:39,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:39,224 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:39,224 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:39,224 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:39,225 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:39,225 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:39,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:39,226 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:39,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:39,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:39,227 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:39,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:39,227 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:39,227 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:39,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:39,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:39,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:39,228 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:39,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:39,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:39,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:39,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:39,229 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:39,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:39,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:39,230 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:39,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:39,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:39,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:39,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:39,281 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:39,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-09-20 13:26:39,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e2ba997c/aecc8ecb9f8d4dc489ed45e753a97c29/FLAG6d6905246 [2019-09-20 13:26:39,918 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:39,919 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-09-20 13:26:39,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e2ba997c/aecc8ecb9f8d4dc489ed45e753a97c29/FLAG6d6905246 [2019-09-20 13:26:40,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e2ba997c/aecc8ecb9f8d4dc489ed45e753a97c29 [2019-09-20 13:26:40,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:40,284 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:40,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:40,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:40,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:40,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70bb4438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:40, skipping insertion in model container [2019-09-20 13:26:40,294 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:40" (1/1) ... [2019-09-20 13:26:40,302 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:40,359 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:40,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:40,919 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:41,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:41,040 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:41,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41 WrapperNode [2019-09-20 13:26:41,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:41,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:41,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:41,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:41,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,092 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... [2019-09-20 13:26:41,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:41,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:41,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:41,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:41,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:41,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:41,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:41,253 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-20 13:26:41,254 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-20 13:26:41,254 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-09-20 13:26:41,254 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-09-20 13:26:41,254 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-09-20 13:26:41,254 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-09-20 13:26:41,255 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-09-20 13:26:41,255 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-09-20 13:26:41,255 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-09-20 13:26:41,255 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-09-20 13:26:41,255 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-09-20 13:26:41,256 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-09-20 13:26:41,256 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-09-20 13:26:41,256 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-09-20 13:26:41,256 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-09-20 13:26:41,256 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-09-20 13:26:41,257 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-20 13:26:41,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:41,257 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-20 13:26:41,257 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-20 13:26:41,257 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-20 13:26:41,258 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-20 13:26:41,258 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-20 13:26:41,258 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-20 13:26:41,258 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-20 13:26:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:26:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:26:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:26:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-09-20 13:26:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-09-20 13:26:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-09-20 13:26:41,260 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-09-20 13:26:41,260 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-09-20 13:26:41,260 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-09-20 13:26:41,260 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-09-20 13:26:41,260 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-09-20 13:26:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-09-20 13:26:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-09-20 13:26:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-09-20 13:26:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-09-20 13:26:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-20 13:26:41,261 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-20 13:26:41,262 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-20 13:26:41,262 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-20 13:26:41,262 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-20 13:26:41,262 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-20 13:26:41,262 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-20 13:26:41,262 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-20 13:26:41,263 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-09-20 13:26:41,263 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-09-20 13:26:41,263 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-20 13:26:41,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:41,263 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-20 13:26:41,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:41,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:41,596 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,780 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-09-20 13:26:41,780 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-09-20 13:26:41,803 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,888 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-20 13:26:41,888 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-20 13:26:41,911 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,936 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-20 13:26:41,937 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-20 13:26:41,946 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:41,957 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-20 13:26:41,957 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-20 13:26:42,215 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,252 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-20 13:26:42,253 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-20 13:26:42,285 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:26:42,308 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-20 13:26:42,309 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-20 13:26:42,369 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:42,369 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:42,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:42 BoogieIcfgContainer [2019-09-20 13:26:42,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:42,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:42,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:42,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:42,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:40" (1/3) ... [2019-09-20 13:26:42,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5184d0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:42, skipping insertion in model container [2019-09-20 13:26:42,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:41" (2/3) ... [2019-09-20 13:26:42,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5184d0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:42, skipping insertion in model container [2019-09-20 13:26:42,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:42" (3/3) ... [2019-09-20 13:26:42,380 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-09-20 13:26:42,390 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:42,399 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:42,417 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:42,445 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:42,445 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:42,445 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:42,446 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:42,446 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:42,446 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:42,446 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:42,446 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2019-09-20 13:26:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:42,483 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:42,484 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:42,486 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:42,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:42,490 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2019-09-20 13:26:42,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:42,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:42,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:42,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:42,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:42,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:42,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:42,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:42,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:42,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:42,791 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2019-09-20 13:26:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,000 INFO L93 Difference]: Finished difference Result 303 states and 411 transitions. [2019-09-20 13:26:43,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,019 INFO L225 Difference]: With dead ends: 303 [2019-09-20 13:26:43,019 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:26:43,022 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:26:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-09-20 13:26:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-20 13:26:43,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2019-09-20 13:26:43,111 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2019-09-20 13:26:43,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,111 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2019-09-20 13:26:43,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2019-09-20 13:26:43,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:43,114 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,114 INFO L407 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-09-20 13:26:43,114 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,115 INFO L82 PathProgramCache]: Analyzing trace with hash -240124352, now seen corresponding path program 1 times [2019-09-20 13:26:43,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,287 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2019-09-20 13:26:43,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,505 INFO L93 Difference]: Finished difference Result 455 states and 623 transitions. [2019-09-20 13:26:43,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,524 INFO L225 Difference]: With dead ends: 455 [2019-09-20 13:26:43,524 INFO L226 Difference]: Without dead ends: 454 [2019-09-20 13:26:43,525 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-20 13:26:43,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2019-09-20 13:26:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-20 13:26:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2019-09-20 13:26:43,604 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2019-09-20 13:26:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,605 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2019-09-20 13:26:43,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2019-09-20 13:26:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:26:43,607 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,607 INFO L407 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-09-20 13:26:43,608 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2018358777, now seen corresponding path program 1 times [2019-09-20 13:26:43,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:43,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:43,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:43,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:43,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:43,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,773 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2019-09-20 13:26:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:43,833 INFO L93 Difference]: Finished difference Result 646 states and 914 transitions. [2019-09-20 13:26:43,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:43,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:26:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:43,841 INFO L225 Difference]: With dead ends: 646 [2019-09-20 13:26:43,842 INFO L226 Difference]: Without dead ends: 646 [2019-09-20 13:26:43,842 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-20 13:26:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2019-09-20 13:26:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-09-20 13:26:43,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2019-09-20 13:26:43,899 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2019-09-20 13:26:43,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:43,900 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2019-09-20 13:26:43,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:43,900 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2019-09-20 13:26:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:26:43,914 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:43,915 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:43,915 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:43,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2019-09-20 13:26:43,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:43,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:43,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:43,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,039 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2019-09-20 13:26:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,157 INFO L93 Difference]: Finished difference Result 617 states and 882 transitions. [2019-09-20 13:26:44,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-20 13:26:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,164 INFO L225 Difference]: With dead ends: 617 [2019-09-20 13:26:44,164 INFO L226 Difference]: Without dead ends: 617 [2019-09-20 13:26:44,165 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-20 13:26:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-09-20 13:26:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-20 13:26:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2019-09-20 13:26:44,195 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2019-09-20 13:26:44,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,195 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2019-09-20 13:26:44,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2019-09-20 13:26:44,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 13:26:44,197 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,197 INFO L407 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-09-20 13:26:44,198 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,198 INFO L82 PathProgramCache]: Analyzing trace with hash -113678377, now seen corresponding path program 1 times [2019-09-20 13:26:44,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,246 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2019-09-20 13:26:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,294 INFO L93 Difference]: Finished difference Result 1053 states and 1556 transitions. [2019-09-20 13:26:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-20 13:26:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,303 INFO L225 Difference]: With dead ends: 1053 [2019-09-20 13:26:44,303 INFO L226 Difference]: Without dead ends: 1053 [2019-09-20 13:26:44,304 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-20 13:26:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2019-09-20 13:26:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-09-20 13:26:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2019-09-20 13:26:44,355 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2019-09-20 13:26:44,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,355 INFO L475 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2019-09-20 13:26:44,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2019-09-20 13:26:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 13:26:44,357 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,357 INFO L407 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-09-20 13:26:44,357 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,358 INFO L82 PathProgramCache]: Analyzing trace with hash -128023286, now seen corresponding path program 1 times [2019-09-20 13:26:44,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,404 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2019-09-20 13:26:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,506 INFO L93 Difference]: Finished difference Result 1045 states and 1547 transitions. [2019-09-20 13:26:44,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-20 13:26:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,516 INFO L225 Difference]: With dead ends: 1045 [2019-09-20 13:26:44,516 INFO L226 Difference]: Without dead ends: 1045 [2019-09-20 13:26:44,516 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-09-20 13:26:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2019-09-20 13:26:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-09-20 13:26:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2019-09-20 13:26:44,565 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2019-09-20 13:26:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,566 INFO L475 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2019-09-20 13:26:44,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2019-09-20 13:26:44,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 13:26:44,573 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,574 INFO L407 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-09-20 13:26:44,574 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash 778971858, now seen corresponding path program 1 times [2019-09-20 13:26:44,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:44,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:44,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:44,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:44,681 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2019-09-20 13:26:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,744 INFO L93 Difference]: Finished difference Result 1055 states and 1561 transitions. [2019-09-20 13:26:44,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:44,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-09-20 13:26:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,754 INFO L225 Difference]: With dead ends: 1055 [2019-09-20 13:26:44,754 INFO L226 Difference]: Without dead ends: 1036 [2019-09-20 13:26:44,754 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-20 13:26:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2019-09-20 13:26:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-09-20 13:26:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2019-09-20 13:26:44,801 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2019-09-20 13:26:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,802 INFO L475 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2019-09-20 13:26:44,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2019-09-20 13:26:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:26:44,805 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,806 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,806 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1897332428, now seen corresponding path program 1 times [2019-09-20 13:26:44,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:44,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,886 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2019-09-20 13:26:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,904 INFO L93 Difference]: Finished difference Result 578 states and 823 transitions. [2019-09-20 13:26:44,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-20 13:26:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,909 INFO L225 Difference]: With dead ends: 578 [2019-09-20 13:26:44,909 INFO L226 Difference]: Without dead ends: 578 [2019-09-20 13:26:44,910 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-20 13:26:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-09-20 13:26:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-20 13:26:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2019-09-20 13:26:44,932 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2019-09-20 13:26:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,936 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2019-09-20 13:26:44,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2019-09-20 13:26:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 13:26:44,941 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,941 INFO L407 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-09-20 13:26:44,941 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2019-09-20 13:26:44,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:45,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:26:45,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:26:45,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:26:45,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:26:45,163 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 10 states. [2019-09-20 13:26:46,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,208 INFO L93 Difference]: Finished difference Result 601 states and 848 transitions. [2019-09-20 13:26:46,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:26:46,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-09-20 13:26:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,214 INFO L225 Difference]: With dead ends: 601 [2019-09-20 13:26:46,214 INFO L226 Difference]: Without dead ends: 601 [2019-09-20 13:26:46,214 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:26:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-20 13:26:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-09-20 13:26:46,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-20 13:26:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2019-09-20 13:26:46,236 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2019-09-20 13:26:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,237 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2019-09-20 13:26:46,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:26:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2019-09-20 13:26:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-20 13:26:46,238 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,238 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:46,238 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2019-09-20 13:26:46,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:46,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:26:46,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:26:46,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:26:46,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:26:46,341 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 10 states. [2019-09-20 13:26:47,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,217 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2019-09-20 13:26:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:26:47,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-20 13:26:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,224 INFO L225 Difference]: With dead ends: 601 [2019-09-20 13:26:47,225 INFO L226 Difference]: Without dead ends: 601 [2019-09-20 13:26:47,226 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:26:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-20 13:26:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-09-20 13:26:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-20 13:26:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2019-09-20 13:26:47,256 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2019-09-20 13:26:47,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,256 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2019-09-20 13:26:47,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:26:47,256 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2019-09-20 13:26:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:26:47,258 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,258 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:47,258 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2019-09-20 13:26:47,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:47,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:47,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:47,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:47,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:47,339 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2019-09-20 13:26:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,411 INFO L93 Difference]: Finished difference Result 598 states and 843 transitions. [2019-09-20 13:26:47,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:26:47,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-20 13:26:47,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,416 INFO L225 Difference]: With dead ends: 598 [2019-09-20 13:26:47,417 INFO L226 Difference]: Without dead ends: 576 [2019-09-20 13:26:47,418 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-20 13:26:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-20 13:26:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-20 13:26:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2019-09-20 13:26:47,447 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2019-09-20 13:26:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,448 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2019-09-20 13:26:47,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2019-09-20 13:26:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:26:47,451 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,451 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:47,452 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1289582749, now seen corresponding path program 1 times [2019-09-20 13:26:47,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:47,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:47,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:47,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:47,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:47,538 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2019-09-20 13:26:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,654 INFO L93 Difference]: Finished difference Result 802 states and 1192 transitions. [2019-09-20 13:26:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:47,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-20 13:26:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,660 INFO L225 Difference]: With dead ends: 802 [2019-09-20 13:26:47,661 INFO L226 Difference]: Without dead ends: 802 [2019-09-20 13:26:47,661 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-20 13:26:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2019-09-20 13:26:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-09-20 13:26:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2019-09-20 13:26:47,697 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2019-09-20 13:26:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,697 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2019-09-20 13:26:47,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2019-09-20 13:26:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:47,699 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,699 INFO L407 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-09-20 13:26:47,700 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1266981467, now seen corresponding path program 1 times [2019-09-20 13:26:47,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:47,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:47,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:47,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:47,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:47,762 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2019-09-20 13:26:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,980 INFO L93 Difference]: Finished difference Result 452 states and 584 transitions. [2019-09-20 13:26:47,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:26:47,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-20 13:26:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,983 INFO L225 Difference]: With dead ends: 452 [2019-09-20 13:26:47,983 INFO L226 Difference]: Without dead ends: 452 [2019-09-20 13:26:47,983 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-20 13:26:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2019-09-20 13:26:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-20 13:26:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2019-09-20 13:26:47,995 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 50 [2019-09-20 13:26:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,996 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2019-09-20 13:26:47,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2019-09-20 13:26:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 13:26:47,997 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,997 INFO L407 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-09-20 13:26:47,998 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash -869356297, now seen corresponding path program 1 times [2019-09-20 13:26:47,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:48,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:48,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:48,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:48,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:48,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:48,074 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2019-09-20 13:26:48,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:48,242 INFO L93 Difference]: Finished difference Result 444 states and 579 transitions. [2019-09-20 13:26:48,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:48,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-20 13:26:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:48,246 INFO L225 Difference]: With dead ends: 444 [2019-09-20 13:26:48,247 INFO L226 Difference]: Without dead ends: 443 [2019-09-20 13:26:48,247 INFO L636 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-09-20 13:26:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-20 13:26:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-20 13:26:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-20 13:26:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2019-09-20 13:26:48,266 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2019-09-20 13:26:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:48,266 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2019-09-20 13:26:48,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2019-09-20 13:26:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-20 13:26:48,268 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:48,268 INFO L407 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-09-20 13:26:48,269 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash -869633127, now seen corresponding path program 1 times [2019-09-20 13:26:48,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:48,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:48,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:48,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:48,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:48,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:48,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:48,374 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2019-09-20 13:26:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:48,458 INFO L93 Difference]: Finished difference Result 477 states and 637 transitions. [2019-09-20 13:26:48,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:48,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-20 13:26:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:48,462 INFO L225 Difference]: With dead ends: 477 [2019-09-20 13:26:48,462 INFO L226 Difference]: Without dead ends: 462 [2019-09-20 13:26:48,462 INFO L636 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-09-20 13:26:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-20 13:26:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2019-09-20 13:26:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-20 13:26:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-09-20 13:26:48,475 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2019-09-20 13:26:48,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:48,475 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-09-20 13:26:48,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-09-20 13:26:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:26:48,477 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:48,477 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:48,477 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:48,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:48,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1156321742, now seen corresponding path program 1 times [2019-09-20 13:26:48,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:48,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:48,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:26:48,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:48,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:26:48,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:26:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:26:48,656 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 11 states. [2019-09-20 13:26:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:49,836 INFO L93 Difference]: Finished difference Result 490 states and 663 transitions. [2019-09-20 13:26:49,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:26:49,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-09-20 13:26:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:49,839 INFO L225 Difference]: With dead ends: 490 [2019-09-20 13:26:49,840 INFO L226 Difference]: Without dead ends: 475 [2019-09-20 13:26:49,840 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:26:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-20 13:26:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 449. [2019-09-20 13:26:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-20 13:26:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-09-20 13:26:49,855 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 48 [2019-09-20 13:26:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:49,856 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-09-20 13:26:49,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:26:49,856 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-09-20 13:26:49,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:26:49,857 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:49,857 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:49,858 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:49,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1551268366, now seen corresponding path program 1 times [2019-09-20 13:26:49,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:49,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:49,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:49,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:49,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:49,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:49,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:49,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:49,937 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2019-09-20 13:26:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,466 INFO L93 Difference]: Finished difference Result 576 states and 789 transitions. [2019-09-20 13:26:50,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:50,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-20 13:26:50,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,470 INFO L225 Difference]: With dead ends: 576 [2019-09-20 13:26:50,470 INFO L226 Difference]: Without dead ends: 561 [2019-09-20 13:26:50,471 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:50,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-20 13:26:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2019-09-20 13:26:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-20 13:26:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2019-09-20 13:26:50,491 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2019-09-20 13:26:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,491 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2019-09-20 13:26:50,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2019-09-20 13:26:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:26:50,493 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,493 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:50,493 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1985376582, now seen corresponding path program 1 times [2019-09-20 13:26:50,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:50,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:50,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:50,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:50,567 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2019-09-20 13:26:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,727 INFO L93 Difference]: Finished difference Result 445 states and 581 transitions. [2019-09-20 13:26:50,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:50,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-20 13:26:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,731 INFO L225 Difference]: With dead ends: 445 [2019-09-20 13:26:50,731 INFO L226 Difference]: Without dead ends: 417 [2019-09-20 13:26:50,731 INFO L636 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-09-20 13:26:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-20 13:26:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-09-20 13:26:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-20 13:26:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2019-09-20 13:26:50,748 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2019-09-20 13:26:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,748 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2019-09-20 13:26:50,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2019-09-20 13:26:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:50,749 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,750 INFO L407 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-09-20 13:26:50,750 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2019-09-20 13:26:50,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:50,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:50,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:50,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:50,813 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2019-09-20 13:26:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,854 INFO L93 Difference]: Finished difference Result 429 states and 560 transitions. [2019-09-20 13:26:50,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:50,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-09-20 13:26:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,858 INFO L225 Difference]: With dead ends: 429 [2019-09-20 13:26:50,858 INFO L226 Difference]: Without dead ends: 399 [2019-09-20 13:26:50,858 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:50,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-20 13:26:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-09-20 13:26:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-20 13:26:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2019-09-20 13:26:50,871 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2019-09-20 13:26:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,871 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2019-09-20 13:26:50,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2019-09-20 13:26:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:26:50,872 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,873 INFO L407 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-09-20 13:26:50,873 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2019-09-20 13:26:50,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:50,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:50,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:50,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:50,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:50,940 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2019-09-20 13:26:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,076 INFO L93 Difference]: Finished difference Result 426 states and 562 transitions. [2019-09-20 13:26:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:51,077 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-09-20 13:26:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,080 INFO L225 Difference]: With dead ends: 426 [2019-09-20 13:26:51,081 INFO L226 Difference]: Without dead ends: 408 [2019-09-20 13:26:51,081 INFO L636 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-09-20 13:26:51,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-20 13:26:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2019-09-20 13:26:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-20 13:26:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2019-09-20 13:26:51,097 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2019-09-20 13:26:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,097 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2019-09-20 13:26:51,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2019-09-20 13:26:51,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:26:51,099 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,099 INFO L407 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-09-20 13:26:51,100 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2019-09-20 13:26:51,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:26:51,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:26:51,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:26:51,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:26:51,143 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2019-09-20 13:26:51,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,172 INFO L93 Difference]: Finished difference Result 410 states and 541 transitions. [2019-09-20 13:26:51,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:26:51,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-20 13:26:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,175 INFO L225 Difference]: With dead ends: 410 [2019-09-20 13:26:51,176 INFO L226 Difference]: Without dead ends: 410 [2019-09-20 13:26:51,176 INFO L636 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-09-20 13:26:51,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-20 13:26:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2019-09-20 13:26:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-20 13:26:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2019-09-20 13:26:51,189 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2019-09-20 13:26:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,189 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2019-09-20 13:26:51,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:26:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2019-09-20 13:26:51,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:26:51,191 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,191 INFO L407 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-09-20 13:26:51,191 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2019-09-20 13:26:51,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:51,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:51,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:26:51,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:51,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:26:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:26:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:51,289 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2019-09-20 13:26:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:51,935 INFO L93 Difference]: Finished difference Result 511 states and 727 transitions. [2019-09-20 13:26:51,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:26:51,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-20 13:26:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:51,941 INFO L225 Difference]: With dead ends: 511 [2019-09-20 13:26:51,942 INFO L226 Difference]: Without dead ends: 511 [2019-09-20 13:26:51,942 INFO L636 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-09-20 13:26:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-20 13:26:51,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2019-09-20 13:26:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-20 13:26:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2019-09-20 13:26:51,963 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2019-09-20 13:26:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:51,964 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2019-09-20 13:26:51,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:26:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2019-09-20 13:26:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:26:51,965 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:51,965 INFO L407 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-09-20 13:26:51,966 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:51,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:51,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2019-09-20 13:26:51,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:51,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:51,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:51,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:52,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:52,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:52,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,017 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2019-09-20 13:26:52,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,141 INFO L93 Difference]: Finished difference Result 659 states and 990 transitions. [2019-09-20 13:26:52,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:52,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-20 13:26:52,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,146 INFO L225 Difference]: With dead ends: 659 [2019-09-20 13:26:52,146 INFO L226 Difference]: Without dead ends: 659 [2019-09-20 13:26:52,147 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-09-20 13:26:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2019-09-20 13:26:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-20 13:26:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2019-09-20 13:26:52,170 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2019-09-20 13:26:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,171 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2019-09-20 13:26:52,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2019-09-20 13:26:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:26:52,172 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,172 INFO L407 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-09-20 13:26:52,172 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,173 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2019-09-20 13:26:52,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:26:52,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:26:52,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:26:52,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:52,249 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2019-09-20 13:26:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:52,304 INFO L93 Difference]: Finished difference Result 595 states and 867 transitions. [2019-09-20 13:26:52,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:26:52,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-20 13:26:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:52,308 INFO L225 Difference]: With dead ends: 595 [2019-09-20 13:26:52,308 INFO L226 Difference]: Without dead ends: 574 [2019-09-20 13:26:52,313 INFO L636 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-09-20 13:26:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-20 13:26:52,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-20 13:26:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-20 13:26:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2019-09-20 13:26:52,334 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2019-09-20 13:26:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:52,335 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2019-09-20 13:26:52,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:26:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2019-09-20 13:26:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:26:52,336 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:52,336 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:52,336 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:52,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2019-09-20 13:26:52,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:52,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:52,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:52,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:52,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:52,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:26:52,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:52,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:26:52,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:26:52,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:26:52,479 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 11 states. [2019-09-20 13:26:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,223 INFO L93 Difference]: Finished difference Result 594 states and 865 transitions. [2019-09-20 13:26:53,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:26:53,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-09-20 13:26:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,228 INFO L225 Difference]: With dead ends: 594 [2019-09-20 13:26:53,228 INFO L226 Difference]: Without dead ends: 573 [2019-09-20 13:26:53,229 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:26:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-09-20 13:26:53,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-09-20 13:26:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-20 13:26:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 842 transitions. [2019-09-20 13:26:53,252 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 842 transitions. Word has length 53 [2019-09-20 13:26:53,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,253 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 842 transitions. [2019-09-20 13:26:53,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:26:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 842 transitions. [2019-09-20 13:26:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:26:53,254 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,255 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:53,255 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,256 INFO L82 PathProgramCache]: Analyzing trace with hash 315899517, now seen corresponding path program 1 times [2019-09-20 13:26:53,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:53,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:53,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:53,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:53,349 INFO L87 Difference]: Start difference. First operand 573 states and 842 transitions. Second operand 5 states. [2019-09-20 13:26:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:53,884 INFO L93 Difference]: Finished difference Result 655 states and 982 transitions. [2019-09-20 13:26:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:53,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-20 13:26:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:53,891 INFO L225 Difference]: With dead ends: 655 [2019-09-20 13:26:53,891 INFO L226 Difference]: Without dead ends: 624 [2019-09-20 13:26:53,892 INFO L636 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-09-20 13:26:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-20 13:26:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2019-09-20 13:26:53,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-20 13:26:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2019-09-20 13:26:53,927 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2019-09-20 13:26:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:53,927 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2019-09-20 13:26:53,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2019-09-20 13:26:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-20 13:26:53,928 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:53,928 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:53,929 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:53,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:53,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1255987189, now seen corresponding path program 1 times [2019-09-20 13:26:53,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:53,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:53,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:53,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:53,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:53,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:53,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:53,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:53,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:53,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:53,979 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2019-09-20 13:26:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,018 INFO L93 Difference]: Finished difference Result 527 states and 773 transitions. [2019-09-20 13:26:54,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-20 13:26:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,023 INFO L225 Difference]: With dead ends: 527 [2019-09-20 13:26:54,023 INFO L226 Difference]: Without dead ends: 527 [2019-09-20 13:26:54,024 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-20 13:26:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-20 13:26:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-20 13:26:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2019-09-20 13:26:54,039 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2019-09-20 13:26:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,040 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2019-09-20 13:26:54,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,040 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2019-09-20 13:26:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:26:54,041 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,041 INFO L407 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-09-20 13:26:54,041 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1573979395, now seen corresponding path program 1 times [2019-09-20 13:26:54,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:54,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:26:54,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:26:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:26:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:26:54,128 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2019-09-20 13:26:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,285 INFO L93 Difference]: Finished difference Result 526 states and 771 transitions. [2019-09-20 13:26:54,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:26:54,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-09-20 13:26:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,289 INFO L225 Difference]: With dead ends: 526 [2019-09-20 13:26:54,289 INFO L226 Difference]: Without dead ends: 466 [2019-09-20 13:26:54,290 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:26:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-20 13:26:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-09-20 13:26:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-20 13:26:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2019-09-20 13:26:54,304 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2019-09-20 13:26:54,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,305 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2019-09-20 13:26:54,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:26:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2019-09-20 13:26:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:26:54,305 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,306 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,306 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2092051162, now seen corresponding path program 1 times [2019-09-20 13:26:54,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:54,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:54,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:54,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:54,372 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2019-09-20 13:26:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,411 INFO L93 Difference]: Finished difference Result 497 states and 782 transitions. [2019-09-20 13:26:54,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:54,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-09-20 13:26:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,415 INFO L225 Difference]: With dead ends: 497 [2019-09-20 13:26:54,415 INFO L226 Difference]: Without dead ends: 497 [2019-09-20 13:26:54,417 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-20 13:26:54,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 481. [2019-09-20 13:26:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-20 13:26:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 750 transitions. [2019-09-20 13:26:54,437 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 750 transitions. Word has length 62 [2019-09-20 13:26:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,437 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 750 transitions. [2019-09-20 13:26:54,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 750 transitions. [2019-09-20 13:26:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:26:54,442 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,442 INFO L407 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-09-20 13:26:54,443 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1395701921, now seen corresponding path program 1 times [2019-09-20 13:26:54,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:54,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:54,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:54,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:54,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,494 INFO L87 Difference]: Start difference. First operand 481 states and 750 transitions. Second operand 3 states. [2019-09-20 13:26:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:54,568 INFO L93 Difference]: Finished difference Result 732 states and 1194 transitions. [2019-09-20 13:26:54,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:54,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-20 13:26:54,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:54,574 INFO L225 Difference]: With dead ends: 732 [2019-09-20 13:26:54,574 INFO L226 Difference]: Without dead ends: 732 [2019-09-20 13:26:54,575 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-09-20 13:26:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 487. [2019-09-20 13:26:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-20 13:26:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 759 transitions. [2019-09-20 13:26:54,601 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 759 transitions. Word has length 63 [2019-09-20 13:26:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:54,602 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 759 transitions. [2019-09-20 13:26:54,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 759 transitions. [2019-09-20 13:26:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:26:54,603 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:54,603 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:54,604 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1133247993, now seen corresponding path program 1 times [2019-09-20 13:26:54,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:54,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:54,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:54,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:54,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:26:54,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:54,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:26:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:26:54,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:26:54,805 INFO L87 Difference]: Start difference. First operand 487 states and 759 transitions. Second operand 9 states. [2019-09-20 13:26:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,706 INFO L93 Difference]: Finished difference Result 786 states and 1387 transitions. [2019-09-20 13:26:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:26:55,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-20 13:26:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,716 INFO L225 Difference]: With dead ends: 786 [2019-09-20 13:26:55,716 INFO L226 Difference]: Without dead ends: 786 [2019-09-20 13:26:55,717 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:26:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-20 13:26:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 516. [2019-09-20 13:26:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-20 13:26:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 826 transitions. [2019-09-20 13:26:55,742 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 826 transitions. Word has length 65 [2019-09-20 13:26:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,743 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 826 transitions. [2019-09-20 13:26:55,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:26:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 826 transitions. [2019-09-20 13:26:55,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:26:55,744 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:55,744 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:55,744 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash -303975472, now seen corresponding path program 1 times [2019-09-20 13:26:55,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:55,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:55,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:55,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:55,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:55,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:55,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:55,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:55,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:55,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:55,916 INFO L87 Difference]: Start difference. First operand 516 states and 826 transitions. Second operand 6 states. [2019-09-20 13:26:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:55,972 INFO L93 Difference]: Finished difference Result 335 states and 482 transitions. [2019-09-20 13:26:55,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:55,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-20 13:26:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:55,977 INFO L225 Difference]: With dead ends: 335 [2019-09-20 13:26:55,977 INFO L226 Difference]: Without dead ends: 335 [2019-09-20 13:26:55,979 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-20 13:26:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2019-09-20 13:26:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-20 13:26:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 482 transitions. [2019-09-20 13:26:55,997 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 482 transitions. Word has length 65 [2019-09-20 13:26:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:55,997 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 482 transitions. [2019-09-20 13:26:55,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 482 transitions. [2019-09-20 13:26:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-20 13:26:55,999 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,000 INFO L407 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] [2019-09-20 13:26:56,000 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1801004585, now seen corresponding path program 1 times [2019-09-20 13:26:56,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,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-09-20 13:26:56,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:56,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:56,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:56,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:56,118 INFO L87 Difference]: Start difference. First operand 335 states and 482 transitions. Second operand 5 states. [2019-09-20 13:26:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:56,428 INFO L93 Difference]: Finished difference Result 310 states and 423 transitions. [2019-09-20 13:26:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:26:56,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-20 13:26:56,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:56,432 INFO L225 Difference]: With dead ends: 310 [2019-09-20 13:26:56,433 INFO L226 Difference]: Without dead ends: 310 [2019-09-20 13:26:56,434 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-20 13:26:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-09-20 13:26:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-20 13:26:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2019-09-20 13:26:56,449 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 69 [2019-09-20 13:26:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:56,449 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2019-09-20 13:26:56,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:56,450 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2019-09-20 13:26:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:26:56,451 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:56,452 INFO L407 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] [2019-09-20 13:26:56,452 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:56,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:56,453 INFO L82 PathProgramCache]: Analyzing trace with hash -671634044, now seen corresponding path program 1 times [2019-09-20 13:26:56,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:56,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:56,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:56,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:56,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:56,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:26:56,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:56,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:26:56,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:26:56,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:26:56,661 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 11 states. [2019-09-20 13:26:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:57,450 INFO L93 Difference]: Finished difference Result 384 states and 543 transitions. [2019-09-20 13:26:57,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:26:57,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-20 13:26:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:57,454 INFO L225 Difference]: With dead ends: 384 [2019-09-20 13:26:57,454 INFO L226 Difference]: Without dead ends: 384 [2019-09-20 13:26:57,455 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:26:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-20 13:26:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 307. [2019-09-20 13:26:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-20 13:26:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2019-09-20 13:26:57,466 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 70 [2019-09-20 13:26:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:57,466 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2019-09-20 13:26:57,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:26:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2019-09-20 13:26:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-20 13:26:57,468 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:57,468 INFO L407 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] [2019-09-20 13:26:57,468 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:57,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:57,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1051957894, now seen corresponding path program 1 times [2019-09-20 13:26:57,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:57,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:57,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:57,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:57,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:57,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:57,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:57,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:57,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:57,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:57,590 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2019-09-20 13:26:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,104 INFO L93 Difference]: Finished difference Result 407 states and 555 transitions. [2019-09-20 13:26:58,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:58,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-20 13:26:58,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,108 INFO L225 Difference]: With dead ends: 407 [2019-09-20 13:26:58,108 INFO L226 Difference]: Without dead ends: 407 [2019-09-20 13:26:58,108 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:26:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-20 13:26:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2019-09-20 13:26:58,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-20 13:26:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2019-09-20 13:26:58,120 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2019-09-20 13:26:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,120 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2019-09-20 13:26:58,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2019-09-20 13:26:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-20 13:26:58,121 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,122 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:58,122 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,122 INFO L82 PathProgramCache]: Analyzing trace with hash 59211627, now seen corresponding path program 1 times [2019-09-20 13:26:58,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:58,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:58,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:58,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:58,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:58,210 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2019-09-20 13:26:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,248 INFO L93 Difference]: Finished difference Result 369 states and 502 transitions. [2019-09-20 13:26:58,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:58,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-20 13:26:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,251 INFO L225 Difference]: With dead ends: 369 [2019-09-20 13:26:58,251 INFO L226 Difference]: Without dead ends: 369 [2019-09-20 13:26:58,252 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-20 13:26:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-09-20 13:26:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-20 13:26:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2019-09-20 13:26:58,263 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2019-09-20 13:26:58,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,263 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2019-09-20 13:26:58,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2019-09-20 13:26:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:26:58,265 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,265 INFO L407 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-09-20 13:26:58,265 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1688145691, now seen corresponding path program 1 times [2019-09-20 13:26:58,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:58,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:26:58,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:26:58,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:26:58,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:26:58,357 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2019-09-20 13:26:58,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:58,767 INFO L93 Difference]: Finished difference Result 337 states and 446 transitions. [2019-09-20 13:26:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:26:58,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-20 13:26:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:58,770 INFO L225 Difference]: With dead ends: 337 [2019-09-20 13:26:58,770 INFO L226 Difference]: Without dead ends: 337 [2019-09-20 13:26:58,770 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-20 13:26:58,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2019-09-20 13:26:58,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-20 13:26:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2019-09-20 13:26:58,785 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2019-09-20 13:26:58,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:58,788 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2019-09-20 13:26:58,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:26:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2019-09-20 13:26:58,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-20 13:26:58,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:58,790 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:58,790 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:58,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:58,791 INFO L82 PathProgramCache]: Analyzing trace with hash 404145100, now seen corresponding path program 1 times [2019-09-20 13:26:58,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:58,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:58,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:58,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:58,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-20 13:26:58,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:58,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:26:58,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:26:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:26:58,969 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2019-09-20 13:26:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,161 INFO L93 Difference]: Finished difference Result 354 states and 462 transitions. [2019-09-20 13:26:59,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:26:59,164 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2019-09-20 13:26:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,166 INFO L225 Difference]: With dead ends: 354 [2019-09-20 13:26:59,166 INFO L226 Difference]: Without dead ends: 332 [2019-09-20 13:26:59,167 INFO L636 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-09-20 13:26:59,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-20 13:26:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-09-20 13:26:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-20 13:26:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2019-09-20 13:26:59,177 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2019-09-20 13:26:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,177 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2019-09-20 13:26:59,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:26:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2019-09-20 13:26:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:26:59,180 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,180 INFO L407 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] [2019-09-20 13:26:59,180 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 558183389, now seen corresponding path program 1 times [2019-09-20 13:26:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:59,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:26:59,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:26:59,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:26:59,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:26:59,263 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2019-09-20 13:26:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:59,612 INFO L93 Difference]: Finished difference Result 458 states and 578 transitions. [2019-09-20 13:26:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:26:59,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-20 13:26:59,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:59,615 INFO L225 Difference]: With dead ends: 458 [2019-09-20 13:26:59,615 INFO L226 Difference]: Without dead ends: 458 [2019-09-20 13:26:59,615 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:26:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-20 13:26:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2019-09-20 13:26:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-20 13:26:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2019-09-20 13:26:59,626 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2019-09-20 13:26:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:59,627 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2019-09-20 13:26:59,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:26:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2019-09-20 13:26:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:26:59,628 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:59,629 INFO L407 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] [2019-09-20 13:26:59,629 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:59,629 INFO L82 PathProgramCache]: Analyzing trace with hash -717142946, now seen corresponding path program 1 times [2019-09-20 13:26:59,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:59,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:59,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:26:59,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:59,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-20 13:26:59,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:59,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:26:59,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:26:59,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:26:59,809 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2019-09-20 13:27:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:02,149 INFO L93 Difference]: Finished difference Result 813 states and 1032 transitions. [2019-09-20 13:27:02,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:27:02,150 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-09-20 13:27:02,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:02,155 INFO L225 Difference]: With dead ends: 813 [2019-09-20 13:27:02,155 INFO L226 Difference]: Without dead ends: 774 [2019-09-20 13:27:02,156 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 13:27:02,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-09-20 13:27:02,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 521. [2019-09-20 13:27:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-09-20 13:27:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 639 transitions. [2019-09-20 13:27:02,170 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 639 transitions. Word has length 103 [2019-09-20 13:27:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:02,171 INFO L475 AbstractCegarLoop]: Abstraction has 521 states and 639 transitions. [2019-09-20 13:27:02,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:27:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 639 transitions. [2019-09-20 13:27:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:02,172 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:02,173 INFO L407 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] [2019-09-20 13:27:02,173 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash -745643236, now seen corresponding path program 1 times [2019-09-20 13:27:02,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:02,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:02,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:02,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:02,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:02,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-20 13:27:02,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:02,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:27:02,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:27:02,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:27:02,325 INFO L87 Difference]: Start difference. First operand 521 states and 639 transitions. Second operand 14 states. [2019-09-20 13:27:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:05,179 INFO L93 Difference]: Finished difference Result 794 states and 1009 transitions. [2019-09-20 13:27:05,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 13:27:05,180 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-09-20 13:27:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:05,183 INFO L225 Difference]: With dead ends: 794 [2019-09-20 13:27:05,184 INFO L226 Difference]: Without dead ends: 755 [2019-09-20 13:27:05,184 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-09-20 13:27:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-20 13:27:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 388. [2019-09-20 13:27:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-20 13:27:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-09-20 13:27:05,196 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2019-09-20 13:27:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:05,197 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-09-20 13:27:05,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:27:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-09-20 13:27:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-20 13:27:05,198 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:05,198 INFO L407 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, 1, 1, 1, 1] [2019-09-20 13:27:05,199 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash 663424798, now seen corresponding path program 1 times [2019-09-20 13:27:05,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:05,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:05,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:05,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:05,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-20 13:27:05,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:05,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 13:27:05,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 13:27:05,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:27:05,606 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2019-09-20 13:27:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:05,775 INFO L93 Difference]: Finished difference Result 420 states and 531 transitions. [2019-09-20 13:27:05,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 13:27:05,775 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-09-20 13:27:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:05,778 INFO L225 Difference]: With dead ends: 420 [2019-09-20 13:27:05,778 INFO L226 Difference]: Without dead ends: 396 [2019-09-20 13:27:05,779 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:27:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-09-20 13:27:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2019-09-20 13:27:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-09-20 13:27:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2019-09-20 13:27:05,788 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2019-09-20 13:27:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:05,788 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2019-09-20 13:27:05,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 13:27:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2019-09-20 13:27:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:27:05,790 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:05,790 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:05,790 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash 672856935, now seen corresponding path program 1 times [2019-09-20 13:27:05,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:05,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:05,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:05,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-20 13:27:05,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:05,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:27:05,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:27:05,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:27:05,957 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2019-09-20 13:27:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:08,123 INFO L93 Difference]: Finished difference Result 778 states and 984 transitions. [2019-09-20 13:27:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:27:08,124 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-09-20 13:27:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:08,129 INFO L225 Difference]: With dead ends: 778 [2019-09-20 13:27:08,129 INFO L226 Difference]: Without dead ends: 719 [2019-09-20 13:27:08,130 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 13:27:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-20 13:27:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 670. [2019-09-20 13:27:08,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-20 13:27:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 828 transitions. [2019-09-20 13:27:08,145 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 828 transitions. Word has length 120 [2019-09-20 13:27:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:08,146 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 828 transitions. [2019-09-20 13:27:08,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:27:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 828 transitions. [2019-09-20 13:27:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:27:08,148 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:08,148 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:08,149 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:08,149 INFO L82 PathProgramCache]: Analyzing trace with hash -365727639, now seen corresponding path program 1 times [2019-09-20 13:27:08,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:08,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:08,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:08,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27: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-09-20 13:27:08,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:08,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-20 13:27:08,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:08,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 13:27:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 13:27:08,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:27:08,307 INFO L87 Difference]: Start difference. First operand 670 states and 828 transitions. Second operand 14 states. [2019-09-20 13:27:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,203 INFO L93 Difference]: Finished difference Result 678 states and 834 transitions. [2019-09-20 13:27:11,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:27:11,204 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-09-20 13:27:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,208 INFO L225 Difference]: With dead ends: 678 [2019-09-20 13:27:11,208 INFO L226 Difference]: Without dead ends: 617 [2019-09-20 13:27:11,209 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-09-20 13:27:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-20 13:27:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 275. [2019-09-20 13:27:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-20 13:27:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 327 transitions. [2019-09-20 13:27:11,231 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 327 transitions. Word has length 120 [2019-09-20 13:27:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,231 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 327 transitions. [2019-09-20 13:27:11,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 13:27:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 327 transitions. [2019-09-20 13:27:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:27:11,234 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,234 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:11,234 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash 147468031, now seen corresponding path program 1 times [2019-09-20 13:27:11,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-20 13:27:11,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:11,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:27:11,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:11,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:27:11,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:27:11,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:27:11,346 INFO L87 Difference]: Start difference. First operand 275 states and 327 transitions. Second operand 6 states. [2019-09-20 13:27:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:11,377 INFO L93 Difference]: Finished difference Result 322 states and 398 transitions. [2019-09-20 13:27:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:11,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-20 13:27:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:11,379 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:27:11,379 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:27:11,380 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:27:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2019-09-20 13:27:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-20 13:27:11,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2019-09-20 13:27:11,386 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 121 [2019-09-20 13:27:11,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:11,387 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2019-09-20 13:27:11,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:27:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2019-09-20 13:27:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-20 13:27:11,389 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:11,389 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-20 13:27:11,389 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:11,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:11,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1256855655, now seen corresponding path program 1 times [2019-09-20 13:27:11,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:11,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-20 13:27:11,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:27:11,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:27:11,495 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-09-20 13:27:11,499 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [17], [22], [27], [30], [161], [162], [165], [170], [296], [301], [305], [308], [313], [316], [317], [318], [319], [320], [333], [335], [338], [342], [348], [354], [356], [358], [365], [367], [368], [369], [371], [375], [377], [384], [388], [392], [394], [398], [400], [407], [409], [434], [438], [484], [537], [542], [544], [545], [546], [549], [552], [554], [560], [563], [571], [574], [576], [581], [584], [588], [596], [599], [602], [604], [615], [616], [661], [664], [686], [687], [695], [696], [697], [698], [703], [735], [741], [742], [743], [744], [745], [746], [747], [753], [754], [757], [758], [759], [760], [763], [764], [765], [766], [793], [794], [795], [796], [799], [800], [805], [811], [812], [813] [2019-09-20 13:27:11,575 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:27:11,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:27:11,739 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.