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-673a906-m [2019-10-03 02:37:10,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:37:10,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:37:10,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:37:10,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:37:10,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:37:10,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:37:10,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:37:10,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:37:10,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:37:10,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:37:10,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:37:10,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:37:10,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:37:10,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:37:10,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:37:10,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:37:10,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:37:10,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:37:10,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:37:10,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:37:10,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:37:10,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:37:10,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:37:10,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:37:10,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:37:10,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:37:10,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:37:10,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:37:10,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:37:10,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:37:10,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:37:10,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:37:10,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:37:10,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:37:10,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:37:10,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:37:10,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:37:10,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:37:10,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:37:10,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:37:10,964 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-10-03 02:37:10,981 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:37:10,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:37:10,982 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:37:10,982 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:37:10,983 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:37:10,983 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:37:10,983 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:37:10,983 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:37:10,984 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:37:10,984 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:37:10,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:37:10,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:37:10,985 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:37:10,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:37:10,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:37:10,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:37:10,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:37:10,986 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:37:10,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:37:10,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:37:10,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:37:10,987 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:37:10,987 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:37:10,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:37:10,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:37:10,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:37:10,988 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:37:10,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:37:10,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:37:10,988 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:37:11,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:37:11,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:37:11,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:37:11,042 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:37:11,042 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:37:11,044 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-10-03 02:37:11,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2995333cf/7d6e50c8f8cf4d46918618a910cf9000/FLAGbcacea4b8 [2019-10-03 02:37:11,666 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:37:11,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-10-03 02:37:11,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2995333cf/7d6e50c8f8cf4d46918618a910cf9000/FLAGbcacea4b8 [2019-10-03 02:37:11,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2995333cf/7d6e50c8f8cf4d46918618a910cf9000 [2019-10-03 02:37:11,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:37:11,949 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:37:11,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:37:11,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:37:11,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:37:11,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:37:11" (1/1) ... [2019-10-03 02:37:11,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0195cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:11, skipping insertion in model container [2019-10-03 02:37:11,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:37:11" (1/1) ... [2019-10-03 02:37:11,968 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:37:12,037 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:37:12,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:37:12,479 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:37:12,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:37:12,625 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:37:12,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:12 WrapperNode [2019-10-03 02:37:12,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:37:12,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:37:12,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:37:12,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:37:12,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:12" (1/1) ... [2019-10-03 02:37:12,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:12" (1/1) ... [2019-10-03 02:37:12,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:12" (1/1) ... [2019-10-03 02:37:12,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:12" (1/1) ... [2019-10-03 02:37:12,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:12" (1/1) ... [2019-10-03 02:37:12,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:12" (1/1) ... [2019-10-03 02:37:12,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:12" (1/1) ... [2019-10-03 02:37:12,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:37:12,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:37:12,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:37:12,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:37:12,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:37:12,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:37:12,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:37:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-10-03 02:37:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-10-03 02:37:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-10-03 02:37:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-10-03 02:37:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-10-03 02:37:12,768 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-10-03 02:37:12,769 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-10-03 02:37:12,769 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-10-03 02:37:12,769 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-10-03 02:37:12,769 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-10-03 02:37:12,769 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-10-03 02:37:12,769 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-10-03 02:37:12,770 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-10-03 02:37:12,770 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-10-03 02:37:12,770 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-10-03 02:37:12,770 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-10-03 02:37:12,770 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-10-03 02:37:12,770 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:37:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-10-03 02:37:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-10-03 02:37:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-10-03 02:37:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-10-03 02:37:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-10-03 02:37:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-10-03 02:37:12,771 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-10-03 02:37:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:37:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 02:37:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:37:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 02:37:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 02:37:12,772 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-10-03 02:37:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-10-03 02:37:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-10-03 02:37:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-10-03 02:37:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-10-03 02:37:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-10-03 02:37:12,773 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-10-03 02:37:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-10-03 02:37:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-10-03 02:37:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-10-03 02:37:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-10-03 02:37:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-10-03 02:37:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-10-03 02:37:12,774 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-10-03 02:37:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-10-03 02:37:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-10-03 02:37:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-10-03 02:37:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-10-03 02:37:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-10-03 02:37:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-10-03 02:37:12,775 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-10-03 02:37:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-10-03 02:37:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-10-03 02:37:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:37:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-10-03 02:37:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:37:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:37:13,149 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:13,308 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-03 02:37:13,308 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-03 02:37:13,322 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:13,394 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-10-03 02:37:13,394 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-10-03 02:37:13,412 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:13,432 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-10-03 02:37:13,432 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-10-03 02:37:13,438 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:13,456 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-10-03 02:37:13,456 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-10-03 02:37:13,707 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:13,758 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-10-03 02:37:13,759 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-10-03 02:37:13,795 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 02:37:13,822 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-10-03 02:37:13,822 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-10-03 02:37:13,864 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:37:13,864 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:37:13,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:37:13 BoogieIcfgContainer [2019-10-03 02:37:13,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:37:13,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:37:13,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:37:13,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:37:13,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:37:11" (1/3) ... [2019-10-03 02:37:13,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5ebc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:37:13, skipping insertion in model container [2019-10-03 02:37:13,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:37:12" (2/3) ... [2019-10-03 02:37:13,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5ebc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:37:13, skipping insertion in model container [2019-10-03 02:37:13,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:37:13" (3/3) ... [2019-10-03 02:37:13,879 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-10-03 02:37:13,889 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:37:13,915 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:37:13,931 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:37:13,970 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:37:13,970 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:37:13,971 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:37:13,971 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:37:13,971 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:37:13,971 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:37:13,972 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:37:13,972 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:37:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2019-10-03 02:37:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:37:14,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:14,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:14,026 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:14,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2019-10-03 02:37:14,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:14,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:14,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:14,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:14,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:14,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:14,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:14,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:14,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:14,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:14,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:14,362 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2019-10-03 02:37:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:14,511 INFO L93 Difference]: Finished difference Result 303 states and 411 transitions. [2019-10-03 02:37:14,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:14,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:37:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:14,528 INFO L225 Difference]: With dead ends: 303 [2019-10-03 02:37:14,528 INFO L226 Difference]: Without dead ends: 287 [2019-10-03 02:37:14,530 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-03 02:37:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-10-03 02:37:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-03 02:37:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2019-10-03 02:37:14,598 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2019-10-03 02:37:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:14,598 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2019-10-03 02:37:14,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2019-10-03 02:37:14,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:37:14,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:14,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:14,601 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:14,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:14,602 INFO L82 PathProgramCache]: Analyzing trace with hash -240124352, now seen corresponding path program 1 times [2019-10-03 02:37:14,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:14,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:14,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:14,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:14,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:14,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:14,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:14,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:14,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:14,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:14,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:14,741 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2019-10-03 02:37:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:14,989 INFO L93 Difference]: Finished difference Result 455 states and 623 transitions. [2019-10-03 02:37:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:14,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:37:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:15,004 INFO L225 Difference]: With dead ends: 455 [2019-10-03 02:37:15,005 INFO L226 Difference]: Without dead ends: 454 [2019-10-03 02:37:15,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-10-03 02:37:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2019-10-03 02:37:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-10-03 02:37:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2019-10-03 02:37:15,056 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2019-10-03 02:37:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:15,057 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2019-10-03 02:37:15,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:15,058 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2019-10-03 02:37:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-03 02:37:15,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:15,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:15,061 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:15,061 INFO L82 PathProgramCache]: Analyzing trace with hash -2018358777, now seen corresponding path program 1 times [2019-10-03 02:37:15,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:15,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:15,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:15,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:15,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:15,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:15,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:15,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:15,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:15,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:15,177 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2019-10-03 02:37:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:15,221 INFO L93 Difference]: Finished difference Result 646 states and 914 transitions. [2019-10-03 02:37:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:15,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-03 02:37:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:15,228 INFO L225 Difference]: With dead ends: 646 [2019-10-03 02:37:15,228 INFO L226 Difference]: Without dead ends: 646 [2019-10-03 02:37:15,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-10-03 02:37:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2019-10-03 02:37:15,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-03 02:37:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2019-10-03 02:37:15,273 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2019-10-03 02:37:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:15,273 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2019-10-03 02:37:15,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2019-10-03 02:37:15,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-03 02:37:15,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:15,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:15,276 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:15,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:15,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2019-10-03 02:37:15,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:15,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:15,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:15,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:15,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:15,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:15,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:15,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:15,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:15,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:15,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:15,418 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2019-10-03 02:37:15,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:15,527 INFO L93 Difference]: Finished difference Result 617 states and 882 transitions. [2019-10-03 02:37:15,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:15,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-03 02:37:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:15,533 INFO L225 Difference]: With dead ends: 617 [2019-10-03 02:37:15,533 INFO L226 Difference]: Without dead ends: 617 [2019-10-03 02:37:15,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:15,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-03 02:37:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-10-03 02:37:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-10-03 02:37:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2019-10-03 02:37:15,564 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2019-10-03 02:37:15,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:15,564 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2019-10-03 02:37:15,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2019-10-03 02:37:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 02:37:15,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:15,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:15,568 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:15,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:15,568 INFO L82 PathProgramCache]: Analyzing trace with hash -113678377, now seen corresponding path program 1 times [2019-10-03 02:37:15,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:15,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:15,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:15,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:15,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:15,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:15,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:15,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:15,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:15,637 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2019-10-03 02:37:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:15,707 INFO L93 Difference]: Finished difference Result 1053 states and 1556 transitions. [2019-10-03 02:37:15,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:15,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-03 02:37:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:15,721 INFO L225 Difference]: With dead ends: 1053 [2019-10-03 02:37:15,721 INFO L226 Difference]: Without dead ends: 1053 [2019-10-03 02:37:15,722 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-10-03 02:37:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2019-10-03 02:37:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-10-03 02:37:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2019-10-03 02:37:15,786 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2019-10-03 02:37:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:15,788 INFO L475 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2019-10-03 02:37:15,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2019-10-03 02:37:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 02:37:15,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:15,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:15,793 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:15,793 INFO L82 PathProgramCache]: Analyzing trace with hash -128023286, now seen corresponding path program 1 times [2019-10-03 02:37:15,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:15,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:15,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:15,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:15,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:15,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:15,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:15,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:15,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:15,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:15,862 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2019-10-03 02:37:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:15,952 INFO L93 Difference]: Finished difference Result 1045 states and 1547 transitions. [2019-10-03 02:37:15,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:15,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-03 02:37:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:15,960 INFO L225 Difference]: With dead ends: 1045 [2019-10-03 02:37:15,961 INFO L226 Difference]: Without dead ends: 1045 [2019-10-03 02:37:15,961 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-10-03 02:37:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2019-10-03 02:37:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-10-03 02:37:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2019-10-03 02:37:16,009 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2019-10-03 02:37:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:16,010 INFO L475 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2019-10-03 02:37:16,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2019-10-03 02:37:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-03 02:37:16,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:16,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:16,014 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash 778971858, now seen corresponding path program 1 times [2019-10-03 02:37:16,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:16,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:16,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:16,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:16,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:16,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:16,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:16,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:16,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:16,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:16,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:16,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:16,089 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2019-10-03 02:37:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:16,133 INFO L93 Difference]: Finished difference Result 1055 states and 1561 transitions. [2019-10-03 02:37:16,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:37:16,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-03 02:37:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:16,141 INFO L225 Difference]: With dead ends: 1055 [2019-10-03 02:37:16,141 INFO L226 Difference]: Without dead ends: 1036 [2019-10-03 02:37:16,142 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:16,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-10-03 02:37:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2019-10-03 02:37:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-10-03 02:37:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2019-10-03 02:37:16,182 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2019-10-03 02:37:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:16,182 INFO L475 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2019-10-03 02:37:16,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2019-10-03 02:37:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-03 02:37:16,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:16,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:16,185 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1897332428, now seen corresponding path program 1 times [2019-10-03 02:37:16,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:16,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:16,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:16,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:16,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:16,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:16,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:16,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:16,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:16,246 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2019-10-03 02:37:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:16,265 INFO L93 Difference]: Finished difference Result 578 states and 823 transitions. [2019-10-03 02:37:16,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:16,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-03 02:37:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:16,272 INFO L225 Difference]: With dead ends: 578 [2019-10-03 02:37:16,272 INFO L226 Difference]: Without dead ends: 578 [2019-10-03 02:37:16,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-03 02:37:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-03 02:37:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-03 02:37:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2019-10-03 02:37:16,296 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2019-10-03 02:37:16,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:16,301 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2019-10-03 02:37:16,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2019-10-03 02:37:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-03 02:37:16,305 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:16,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:16,306 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:16,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2019-10-03 02:37:16,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:16,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:16,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:16,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:16,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:16,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:16,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:37:16,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:16,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:37:16,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:37:16,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:37:16,475 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 10 states. [2019-10-03 02:37:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:17,527 INFO L93 Difference]: Finished difference Result 601 states and 848 transitions. [2019-10-03 02:37:17,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:37:17,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-10-03 02:37:17,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:17,533 INFO L225 Difference]: With dead ends: 601 [2019-10-03 02:37:17,533 INFO L226 Difference]: Without dead ends: 601 [2019-10-03 02:37:17,535 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:37:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-03 02:37:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-10-03 02:37:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-03 02:37:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2019-10-03 02:37:17,557 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2019-10-03 02:37:17,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:17,557 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2019-10-03 02:37:17,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:37:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2019-10-03 02:37:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-03 02:37:17,559 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:17,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:17,560 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:17,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2019-10-03 02:37:17,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:17,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:17,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:17,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:37:17,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:17,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:37:17,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:37:17,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:37:17,672 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 10 states. [2019-10-03 02:37:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:18,473 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2019-10-03 02:37:18,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:37:18,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-10-03 02:37:18,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:18,479 INFO L225 Difference]: With dead ends: 601 [2019-10-03 02:37:18,479 INFO L226 Difference]: Without dead ends: 601 [2019-10-03 02:37:18,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:37:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-03 02:37:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-10-03 02:37:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-03 02:37:18,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2019-10-03 02:37:18,504 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2019-10-03 02:37:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:18,505 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2019-10-03 02:37:18,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:37:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2019-10-03 02:37:18,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 02:37:18,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:18,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:18,507 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:18,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2019-10-03 02:37:18,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:18,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:18,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:18,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:18,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:18,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:18,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:18,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:18,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:18,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:18,573 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2019-10-03 02:37:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:18,623 INFO L93 Difference]: Finished difference Result 598 states and 843 transitions. [2019-10-03 02:37:18,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:37:18,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-03 02:37:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:18,628 INFO L225 Difference]: With dead ends: 598 [2019-10-03 02:37:18,628 INFO L226 Difference]: Without dead ends: 576 [2019-10-03 02:37:18,629 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-03 02:37:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-03 02:37:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-03 02:37:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2019-10-03 02:37:18,649 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2019-10-03 02:37:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:18,649 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2019-10-03 02:37:18,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2019-10-03 02:37:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 02:37:18,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:18,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:18,651 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:18,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:18,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1289582749, now seen corresponding path program 1 times [2019-10-03 02:37:18,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:18,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:18,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:18,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:18,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:18,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:18,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:18,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:18,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:18,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:18,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:18,721 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2019-10-03 02:37:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:18,836 INFO L93 Difference]: Finished difference Result 802 states and 1192 transitions. [2019-10-03 02:37:18,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:18,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-03 02:37:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:18,843 INFO L225 Difference]: With dead ends: 802 [2019-10-03 02:37:18,843 INFO L226 Difference]: Without dead ends: 802 [2019-10-03 02:37:18,843 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-10-03 02:37:18,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2019-10-03 02:37:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-03 02:37:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2019-10-03 02:37:18,872 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2019-10-03 02:37:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:18,873 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2019-10-03 02:37:18,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2019-10-03 02:37:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 02:37:18,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:18,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:18,874 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:18,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:18,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1266981467, now seen corresponding path program 1 times [2019-10-03 02:37:18,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:18,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:18,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:18,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:18,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:18,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:18,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:37:18,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:18,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:37:18,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:37:18,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:37:18,921 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2019-10-03 02:37:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:19,104 INFO L93 Difference]: Finished difference Result 452 states and 584 transitions. [2019-10-03 02:37:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:37:19,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-10-03 02:37:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:19,108 INFO L225 Difference]: With dead ends: 452 [2019-10-03 02:37:19,108 INFO L226 Difference]: Without dead ends: 452 [2019-10-03 02:37:19,109 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:37:19,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-10-03 02:37:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2019-10-03 02:37:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-10-03 02:37:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2019-10-03 02:37:19,131 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 50 [2019-10-03 02:37:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:19,133 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2019-10-03 02:37:19,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:37:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2019-10-03 02:37:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 02:37:19,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:19,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:19,135 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:19,136 INFO L82 PathProgramCache]: Analyzing trace with hash -869356297, now seen corresponding path program 1 times [2019-10-03 02:37:19,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:19,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:19,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:19,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:19,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:19,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:37:19,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:19,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:37:19,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:37:19,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:19,262 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2019-10-03 02:37:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:19,505 INFO L93 Difference]: Finished difference Result 444 states and 579 transitions. [2019-10-03 02:37:19,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:37:19,506 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-03 02:37:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:19,509 INFO L225 Difference]: With dead ends: 444 [2019-10-03 02:37:19,510 INFO L226 Difference]: Without dead ends: 443 [2019-10-03 02:37:19,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-03 02:37:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-10-03 02:37:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-03 02:37:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2019-10-03 02:37:19,530 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2019-10-03 02:37:19,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:19,530 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2019-10-03 02:37:19,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:37:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2019-10-03 02:37:19,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 02:37:19,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:19,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:19,532 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:19,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash -869633127, now seen corresponding path program 1 times [2019-10-03 02:37:19,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:19,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:19,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:19,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:19,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:19,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:19,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:37:19,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:19,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:37:19,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:37:19,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:19,650 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2019-10-03 02:37:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:19,720 INFO L93 Difference]: Finished difference Result 477 states and 637 transitions. [2019-10-03 02:37:19,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:37:19,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-10-03 02:37:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:19,723 INFO L225 Difference]: With dead ends: 477 [2019-10-03 02:37:19,723 INFO L226 Difference]: Without dead ends: 462 [2019-10-03 02:37:19,726 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:19,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-10-03 02:37:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2019-10-03 02:37:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-03 02:37:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-10-03 02:37:19,742 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2019-10-03 02:37:19,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:19,742 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-10-03 02:37:19,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:37:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-10-03 02:37:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 02:37:19,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:19,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:19,744 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:19,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1156321742, now seen corresponding path program 1 times [2019-10-03 02:37:19,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:19,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:19,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:19,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:19,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:19,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:19,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:37:19,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:19,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:37:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:37:19,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:19,909 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 11 states. [2019-10-03 02:37:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:20,805 INFO L93 Difference]: Finished difference Result 490 states and 663 transitions. [2019-10-03 02:37:20,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:37:20,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-10-03 02:37:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:20,808 INFO L225 Difference]: With dead ends: 490 [2019-10-03 02:37:20,809 INFO L226 Difference]: Without dead ends: 475 [2019-10-03 02:37:20,809 INFO L640 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-10-03 02:37:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-10-03 02:37:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 449. [2019-10-03 02:37:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-10-03 02:37:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-10-03 02:37:20,823 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 48 [2019-10-03 02:37:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:20,823 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-10-03 02:37:20,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:37:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-10-03 02:37:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 02:37:20,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:20,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:20,825 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:20,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:20,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1551268366, now seen corresponding path program 1 times [2019-10-03 02:37:20,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:20,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:20,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:20,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:20,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:20,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:20,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:20,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:20,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:20,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:20,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:20,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:20,918 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2019-10-03 02:37:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:21,382 INFO L93 Difference]: Finished difference Result 576 states and 789 transitions. [2019-10-03 02:37:21,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:37:21,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-03 02:37:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:21,386 INFO L225 Difference]: With dead ends: 576 [2019-10-03 02:37:21,387 INFO L226 Difference]: Without dead ends: 561 [2019-10-03 02:37:21,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-03 02:37:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2019-10-03 02:37:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-10-03 02:37:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2019-10-03 02:37:21,405 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2019-10-03 02:37:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:21,406 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2019-10-03 02:37:21,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2019-10-03 02:37:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-03 02:37:21,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:21,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:21,407 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1985376582, now seen corresponding path program 1 times [2019-10-03 02:37:21,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:21,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:21,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:21,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:21,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:21,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-10-03 02:37:21,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:21,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:37:21,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:21,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:37:21,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:37:21,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:21,495 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2019-10-03 02:37:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:21,631 INFO L93 Difference]: Finished difference Result 445 states and 581 transitions. [2019-10-03 02:37:21,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:37:21,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-03 02:37:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:21,634 INFO L225 Difference]: With dead ends: 445 [2019-10-03 02:37:21,634 INFO L226 Difference]: Without dead ends: 417 [2019-10-03 02:37:21,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-10-03 02:37:21,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-10-03 02:37:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-10-03 02:37:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2019-10-03 02:37:21,645 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2019-10-03 02:37:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:21,646 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2019-10-03 02:37:21,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:37:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2019-10-03 02:37:21,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 02:37:21,650 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:21,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:21,651 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:21,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:21,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2019-10-03 02:37:21,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:21,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:21,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:21,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:21,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:21,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:21,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:21,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:21,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:21,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:21,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:21,713 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2019-10-03 02:37:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:21,746 INFO L93 Difference]: Finished difference Result 429 states and 560 transitions. [2019-10-03 02:37:21,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:21,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-10-03 02:37:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:21,749 INFO L225 Difference]: With dead ends: 429 [2019-10-03 02:37:21,749 INFO L226 Difference]: Without dead ends: 399 [2019-10-03 02:37:21,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-03 02:37:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-10-03 02:37:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-10-03 02:37:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2019-10-03 02:37:21,762 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2019-10-03 02:37:21,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:21,763 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2019-10-03 02:37:21,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2019-10-03 02:37:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-03 02:37:21,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:21,766 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:21,766 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:21,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:21,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2019-10-03 02:37:21,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:21,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:21,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:21,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:21,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:21,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:21,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:37:21,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:21,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:37:21,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:37:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:21,850 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2019-10-03 02:37:21,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:21,963 INFO L93 Difference]: Finished difference Result 426 states and 562 transitions. [2019-10-03 02:37:21,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:37:21,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-10-03 02:37:21,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:21,969 INFO L225 Difference]: With dead ends: 426 [2019-10-03 02:37:21,969 INFO L226 Difference]: Without dead ends: 408 [2019-10-03 02:37:21,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-10-03 02:37:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2019-10-03 02:37:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-10-03 02:37:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2019-10-03 02:37:21,980 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2019-10-03 02:37:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:21,980 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2019-10-03 02:37:21,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:37:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2019-10-03 02:37:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:37:21,981 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:21,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:21,982 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:21,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:21,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2019-10-03 02:37:21,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:21,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:21,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:21,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:21,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:22,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:22,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:37:22,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:22,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:37:22,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:37:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:37:22,028 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2019-10-03 02:37:22,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:22,052 INFO L93 Difference]: Finished difference Result 410 states and 541 transitions. [2019-10-03 02:37:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:37:22,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-10-03 02:37:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:22,055 INFO L225 Difference]: With dead ends: 410 [2019-10-03 02:37:22,055 INFO L226 Difference]: Without dead ends: 410 [2019-10-03 02:37:22,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-03 02:37:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2019-10-03 02:37:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-10-03 02:37:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2019-10-03 02:37:22,066 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2019-10-03 02:37:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:22,066 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2019-10-03 02:37:22,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:37:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2019-10-03 02:37:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:37:22,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:22,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:22,069 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:22,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2019-10-03 02:37:22,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:22,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:22,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:22,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:22,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:22,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:22,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:22,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:37:22,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:22,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:37:22,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:37:22,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:22,135 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2019-10-03 02:37:22,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:22,911 INFO L93 Difference]: Finished difference Result 511 states and 727 transitions. [2019-10-03 02:37:22,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:37:22,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-10-03 02:37:22,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:22,916 INFO L225 Difference]: With dead ends: 511 [2019-10-03 02:37:22,916 INFO L226 Difference]: Without dead ends: 511 [2019-10-03 02:37:22,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:37:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-10-03 02:37:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2019-10-03 02:37:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-10-03 02:37:22,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2019-10-03 02:37:22,930 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2019-10-03 02:37:22,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:22,930 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2019-10-03 02:37:22,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:37:22,930 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2019-10-03 02:37:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-03 02:37:22,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:22,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:22,932 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:22,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:22,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2019-10-03 02:37:22,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:22,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:22,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:22,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:22,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:22,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:22,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:22,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:22,964 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2019-10-03 02:37:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:23,054 INFO L93 Difference]: Finished difference Result 659 states and 990 transitions. [2019-10-03 02:37:23,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:23,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-03 02:37:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:23,059 INFO L225 Difference]: With dead ends: 659 [2019-10-03 02:37:23,059 INFO L226 Difference]: Without dead ends: 659 [2019-10-03 02:37:23,059 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-03 02:37:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2019-10-03 02:37:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-03 02:37:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2019-10-03 02:37:23,082 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2019-10-03 02:37:23,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:23,082 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2019-10-03 02:37:23,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:23,082 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2019-10-03 02:37:23,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-03 02:37:23,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:23,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:23,084 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:23,084 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2019-10-03 02:37:23,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:23,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:23,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:23,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:23,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:23,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:23,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:37:23,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:23,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:37:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:37:23,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:23,160 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2019-10-03 02:37:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:23,212 INFO L93 Difference]: Finished difference Result 595 states and 867 transitions. [2019-10-03 02:37:23,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:37:23,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-10-03 02:37:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:23,216 INFO L225 Difference]: With dead ends: 595 [2019-10-03 02:37:23,216 INFO L226 Difference]: Without dead ends: 574 [2019-10-03 02:37:23,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-03 02:37:23,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-03 02:37:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-03 02:37:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2019-10-03 02:37:23,238 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2019-10-03 02:37:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:23,238 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2019-10-03 02:37:23,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:37:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2019-10-03 02:37:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-03 02:37:23,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:23,239 INFO L411 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-10-03 02:37:23,239 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2019-10-03 02:37:23,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:23,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:23,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:23,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-10-03 02:37:23,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:23,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:37:23,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:23,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:37:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:37:23,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:23,374 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 11 states. [2019-10-03 02:37:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:24,110 INFO L93 Difference]: Finished difference Result 594 states and 865 transitions. [2019-10-03 02:37:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:37:24,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-10-03 02:37:24,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:24,114 INFO L225 Difference]: With dead ends: 594 [2019-10-03 02:37:24,114 INFO L226 Difference]: Without dead ends: 573 [2019-10-03 02:37:24,115 INFO L640 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-10-03 02:37:24,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-10-03 02:37:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-10-03 02:37:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-03 02:37:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 842 transitions. [2019-10-03 02:37:24,136 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 842 transitions. Word has length 53 [2019-10-03 02:37:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:24,137 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 842 transitions. [2019-10-03 02:37:24,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:37:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 842 transitions. [2019-10-03 02:37:24,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-03 02:37:24,138 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:24,138 INFO L411 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-10-03 02:37:24,139 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:24,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:24,139 INFO L82 PathProgramCache]: Analyzing trace with hash 315899517, now seen corresponding path program 1 times [2019-10-03 02:37:24,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:24,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:24,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:24,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:24,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:24,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:24,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:24,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:24,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:24,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:24,252 INFO L87 Difference]: Start difference. First operand 573 states and 842 transitions. Second operand 5 states. [2019-10-03 02:37:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:24,701 INFO L93 Difference]: Finished difference Result 655 states and 982 transitions. [2019-10-03 02:37:24,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:37:24,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-03 02:37:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:24,706 INFO L225 Difference]: With dead ends: 655 [2019-10-03 02:37:24,706 INFO L226 Difference]: Without dead ends: 624 [2019-10-03 02:37:24,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-03 02:37:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2019-10-03 02:37:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-03 02:37:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2019-10-03 02:37:24,726 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2019-10-03 02:37:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:24,726 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2019-10-03 02:37:24,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2019-10-03 02:37:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-03 02:37:24,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:24,728 INFO L411 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-10-03 02:37:24,728 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1255987189, now seen corresponding path program 1 times [2019-10-03 02:37:24,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:24,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:24,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:24,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:24,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:24,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:24,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:24,778 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2019-10-03 02:37:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:24,822 INFO L93 Difference]: Finished difference Result 527 states and 773 transitions. [2019-10-03 02:37:24,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:24,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-03 02:37:24,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:24,826 INFO L225 Difference]: With dead ends: 527 [2019-10-03 02:37:24,826 INFO L226 Difference]: Without dead ends: 527 [2019-10-03 02:37:24,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-03 02:37:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-10-03 02:37:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-10-03 02:37:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2019-10-03 02:37:24,841 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2019-10-03 02:37:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:24,841 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2019-10-03 02:37:24,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2019-10-03 02:37:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 02:37:24,843 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:24,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:24,843 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:24,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:24,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1573979395, now seen corresponding path program 1 times [2019-10-03 02:37:24,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:24,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:24,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:24,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:24,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:24,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:24,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:37:24,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:24,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:37:24,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:37:24,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:37:24,924 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2019-10-03 02:37:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:25,077 INFO L93 Difference]: Finished difference Result 526 states and 771 transitions. [2019-10-03 02:37:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:37:25,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-10-03 02:37:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:25,081 INFO L225 Difference]: With dead ends: 526 [2019-10-03 02:37:25,081 INFO L226 Difference]: Without dead ends: 466 [2019-10-03 02:37:25,081 INFO L640 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-10-03 02:37:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-03 02:37:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-10-03 02:37:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-03 02:37:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2019-10-03 02:37:25,095 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2019-10-03 02:37:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:25,095 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2019-10-03 02:37:25,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:37:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2019-10-03 02:37:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 02:37:25,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:25,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:25,096 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:25,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2092051162, now seen corresponding path program 1 times [2019-10-03 02:37:25,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:25,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:25,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:25,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:25,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:25,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:25,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:25,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:25,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:25,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:25,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:25,165 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2019-10-03 02:37:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:25,202 INFO L93 Difference]: Finished difference Result 497 states and 782 transitions. [2019-10-03 02:37:25,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:25,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-10-03 02:37:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:25,206 INFO L225 Difference]: With dead ends: 497 [2019-10-03 02:37:25,207 INFO L226 Difference]: Without dead ends: 497 [2019-10-03 02:37:25,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:25,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-10-03 02:37:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 481. [2019-10-03 02:37:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-10-03 02:37:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 750 transitions. [2019-10-03 02:37:25,226 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 750 transitions. Word has length 62 [2019-10-03 02:37:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:25,227 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 750 transitions. [2019-10-03 02:37:25,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 750 transitions. [2019-10-03 02:37:25,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 02:37:25,228 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:25,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:25,229 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:25,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1395701921, now seen corresponding path program 1 times [2019-10-03 02:37:25,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:25,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:25,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:25,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:25,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:25,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:25,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:37:25,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:25,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:37:25,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:37:25,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:25,277 INFO L87 Difference]: Start difference. First operand 481 states and 750 transitions. Second operand 3 states. [2019-10-03 02:37:25,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:25,346 INFO L93 Difference]: Finished difference Result 732 states and 1194 transitions. [2019-10-03 02:37:25,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:37:25,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-03 02:37:25,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:25,352 INFO L225 Difference]: With dead ends: 732 [2019-10-03 02:37:25,352 INFO L226 Difference]: Without dead ends: 732 [2019-10-03 02:37:25,354 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:37:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-10-03 02:37:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 487. [2019-10-03 02:37:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-10-03 02:37:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 759 transitions. [2019-10-03 02:37:25,375 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 759 transitions. Word has length 63 [2019-10-03 02:37:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:25,375 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 759 transitions. [2019-10-03 02:37:25,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:37:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 759 transitions. [2019-10-03 02:37:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:37:25,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:25,376 INFO L411 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-10-03 02:37:25,377 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:25,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:25,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1133247993, now seen corresponding path program 1 times [2019-10-03 02:37:25,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:25,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:25,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:25,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:25,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:25,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:37:25,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:25,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:37:25,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:37:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:37:25,527 INFO L87 Difference]: Start difference. First operand 487 states and 759 transitions. Second operand 9 states. [2019-10-03 02:37:26,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:26,407 INFO L93 Difference]: Finished difference Result 786 states and 1387 transitions. [2019-10-03 02:37:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:37:26,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-10-03 02:37:26,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:26,414 INFO L225 Difference]: With dead ends: 786 [2019-10-03 02:37:26,414 INFO L226 Difference]: Without dead ends: 786 [2019-10-03 02:37:26,415 INFO L640 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-10-03 02:37:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-10-03 02:37:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 516. [2019-10-03 02:37:26,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-10-03 02:37:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 826 transitions. [2019-10-03 02:37:26,440 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 826 transitions. Word has length 65 [2019-10-03 02:37:26,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:26,441 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 826 transitions. [2019-10-03 02:37:26,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:37:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 826 transitions. [2019-10-03 02:37:26,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-03 02:37:26,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:26,442 INFO L411 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-10-03 02:37:26,442 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:26,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:26,443 INFO L82 PathProgramCache]: Analyzing trace with hash -303975472, now seen corresponding path program 1 times [2019-10-03 02:37:26,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:26,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:26,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:26,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:26,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:26,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:26,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:26,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:26,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:26,588 INFO L87 Difference]: Start difference. First operand 516 states and 826 transitions. Second operand 6 states. [2019-10-03 02:37:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:26,619 INFO L93 Difference]: Finished difference Result 335 states and 482 transitions. [2019-10-03 02:37:26,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:26,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-03 02:37:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:26,622 INFO L225 Difference]: With dead ends: 335 [2019-10-03 02:37:26,622 INFO L226 Difference]: Without dead ends: 335 [2019-10-03 02:37:26,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-10-03 02:37:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2019-10-03 02:37:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-10-03 02:37:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 482 transitions. [2019-10-03 02:37:26,633 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 482 transitions. Word has length 65 [2019-10-03 02:37:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:26,634 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 482 transitions. [2019-10-03 02:37:26,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 482 transitions. [2019-10-03 02:37:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-03 02:37:26,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:26,635 INFO L411 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-10-03 02:37:26,635 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1801004585, now seen corresponding path program 1 times [2019-10-03 02:37:26,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:26,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:26,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:26,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:26,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:26,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:26,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:26,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:26,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:26,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:26,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:26,696 INFO L87 Difference]: Start difference. First operand 335 states and 482 transitions. Second operand 5 states. [2019-10-03 02:37:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:26,896 INFO L93 Difference]: Finished difference Result 310 states and 423 transitions. [2019-10-03 02:37:26,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:37:26,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-10-03 02:37:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:26,899 INFO L225 Difference]: With dead ends: 310 [2019-10-03 02:37:26,899 INFO L226 Difference]: Without dead ends: 310 [2019-10-03 02:37:26,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-10-03 02:37:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-10-03 02:37:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-10-03 02:37:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2019-10-03 02:37:26,907 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 69 [2019-10-03 02:37:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:26,907 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2019-10-03 02:37:26,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2019-10-03 02:37:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-03 02:37:26,909 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:26,909 INFO L411 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-10-03 02:37:26,909 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:26,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash -671634044, now seen corresponding path program 1 times [2019-10-03 02:37:26,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:26,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:26,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:26,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:26,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:27,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:27,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:37:27,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:27,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:37:27,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:37:27,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:37:27,054 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 11 states. [2019-10-03 02:37:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:27,887 INFO L93 Difference]: Finished difference Result 384 states and 543 transitions. [2019-10-03 02:37:27,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:37:27,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-10-03 02:37:27,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:27,890 INFO L225 Difference]: With dead ends: 384 [2019-10-03 02:37:27,890 INFO L226 Difference]: Without dead ends: 384 [2019-10-03 02:37:27,891 INFO L640 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-10-03 02:37:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-10-03 02:37:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 307. [2019-10-03 02:37:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-03 02:37:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2019-10-03 02:37:27,901 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 70 [2019-10-03 02:37:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:27,901 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2019-10-03 02:37:27,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:37:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2019-10-03 02:37:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-03 02:37:27,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:27,902 INFO L411 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-10-03 02:37:27,903 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1051957894, now seen corresponding path program 1 times [2019-10-03 02:37:27,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:27,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:27,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:27,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:27,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:28,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:28,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:28,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:28,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:28,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:28,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:28,057 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2019-10-03 02:37:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:28,527 INFO L93 Difference]: Finished difference Result 407 states and 555 transitions. [2019-10-03 02:37:28,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:28,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-10-03 02:37:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:28,530 INFO L225 Difference]: With dead ends: 407 [2019-10-03 02:37:28,530 INFO L226 Difference]: Without dead ends: 407 [2019-10-03 02:37:28,530 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:37:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-10-03 02:37:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2019-10-03 02:37:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-03 02:37:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2019-10-03 02:37:28,541 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2019-10-03 02:37:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:28,541 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2019-10-03 02:37:28,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2019-10-03 02:37:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 02:37:28,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:28,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:28,542 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:28,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash 59211627, now seen corresponding path program 1 times [2019-10-03 02:37:28,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:28,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:28,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:28,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:28,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:28,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:28,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:28,621 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2019-10-03 02:37:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:28,651 INFO L93 Difference]: Finished difference Result 369 states and 502 transitions. [2019-10-03 02:37:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:28,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-10-03 02:37:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:28,653 INFO L225 Difference]: With dead ends: 369 [2019-10-03 02:37:28,654 INFO L226 Difference]: Without dead ends: 369 [2019-10-03 02:37:28,654 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-03 02:37:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-10-03 02:37:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-10-03 02:37:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2019-10-03 02:37:28,663 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2019-10-03 02:37:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:28,664 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2019-10-03 02:37:28,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2019-10-03 02:37:28,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-03 02:37:28,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:28,665 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:28,665 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:28,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:28,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1688145691, now seen corresponding path program 1 times [2019-10-03 02:37:28,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:28,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:28,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:28,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:28,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:28,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:28,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:28,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:28,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:28,734 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2019-10-03 02:37:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:29,161 INFO L93 Difference]: Finished difference Result 337 states and 446 transitions. [2019-10-03 02:37:29,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:37:29,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-10-03 02:37:29,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:29,163 INFO L225 Difference]: With dead ends: 337 [2019-10-03 02:37:29,163 INFO L226 Difference]: Without dead ends: 337 [2019-10-03 02:37:29,164 INFO L640 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-10-03 02:37:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-03 02:37:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2019-10-03 02:37:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-10-03 02:37:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2019-10-03 02:37:29,173 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2019-10-03 02:37:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:29,173 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2019-10-03 02:37:29,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2019-10-03 02:37:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-03 02:37:29,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:29,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:37:29,175 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:29,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash 404145100, now seen corresponding path program 1 times [2019-10-03 02:37:29,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:29,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:29,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:29,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:29,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:29,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:29,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:37:29,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:29,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:37:29,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:37:29,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:37:29,388 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2019-10-03 02:37:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:29,652 INFO L93 Difference]: Finished difference Result 354 states and 462 transitions. [2019-10-03 02:37:29,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:37:29,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2019-10-03 02:37:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:29,654 INFO L225 Difference]: With dead ends: 354 [2019-10-03 02:37:29,654 INFO L226 Difference]: Without dead ends: 332 [2019-10-03 02:37:29,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:37:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-03 02:37:29,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-10-03 02:37:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-10-03 02:37:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2019-10-03 02:37:29,662 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2019-10-03 02:37:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:29,663 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2019-10-03 02:37:29,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:37:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2019-10-03 02:37:29,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 02:37:29,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:29,665 INFO L411 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-10-03 02:37:29,665 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash 558183389, now seen corresponding path program 1 times [2019-10-03 02:37:29,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:29,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:29,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:29,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:29,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:29,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:29,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:29,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:37:29,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:29,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:37:29,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:37:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:37:29,755 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2019-10-03 02:37:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:30,166 INFO L93 Difference]: Finished difference Result 458 states and 578 transitions. [2019-10-03 02:37:30,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:30,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-03 02:37:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:30,169 INFO L225 Difference]: With dead ends: 458 [2019-10-03 02:37:30,169 INFO L226 Difference]: Without dead ends: 458 [2019-10-03 02:37:30,169 INFO L640 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-10-03 02:37:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-03 02:37:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2019-10-03 02:37:30,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-10-03 02:37:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2019-10-03 02:37:30,203 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2019-10-03 02:37:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:30,204 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2019-10-03 02:37:30,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:37:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2019-10-03 02:37:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 02:37:30,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:30,206 INFO L411 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-10-03 02:37:30,206 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:30,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash -717142946, now seen corresponding path program 1 times [2019-10-03 02:37:30,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:30,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:30,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:30,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:30,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:30,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:37:30,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:30,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:37:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:37:30,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:37:30,371 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2019-10-03 02:37:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:32,502 INFO L93 Difference]: Finished difference Result 813 states and 1032 transitions. [2019-10-03 02:37:32,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 02:37:32,502 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-10-03 02:37:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:32,507 INFO L225 Difference]: With dead ends: 813 [2019-10-03 02:37:32,507 INFO L226 Difference]: Without dead ends: 774 [2019-10-03 02:37:32,507 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-10-03 02:37:32,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-10-03 02:37:32,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 521. [2019-10-03 02:37:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-10-03 02:37:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 639 transitions. [2019-10-03 02:37:32,521 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 639 transitions. Word has length 103 [2019-10-03 02:37:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:32,521 INFO L475 AbstractCegarLoop]: Abstraction has 521 states and 639 transitions. [2019-10-03 02:37:32,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:37:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 639 transitions. [2019-10-03 02:37:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-03 02:37:32,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:32,523 INFO L411 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-10-03 02:37:32,524 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:32,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:32,524 INFO L82 PathProgramCache]: Analyzing trace with hash -745643236, now seen corresponding path program 1 times [2019-10-03 02:37:32,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:32,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:32,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:32,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:32,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:32,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:32,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:37:32,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:32,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:37:32,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:37:32,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:37:32,666 INFO L87 Difference]: Start difference. First operand 521 states and 639 transitions. Second operand 14 states. [2019-10-03 02:37:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:35,443 INFO L93 Difference]: Finished difference Result 794 states and 1009 transitions. [2019-10-03 02:37:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-03 02:37:35,443 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-10-03 02:37:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:35,448 INFO L225 Difference]: With dead ends: 794 [2019-10-03 02:37:35,448 INFO L226 Difference]: Without dead ends: 755 [2019-10-03 02:37:35,449 INFO L640 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-10-03 02:37:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-10-03 02:37:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 388. [2019-10-03 02:37:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-03 02:37:35,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-10-03 02:37:35,461 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2019-10-03 02:37:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:35,461 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-10-03 02:37:35,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:37:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-10-03 02:37:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-03 02:37:35,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:35,463 INFO L411 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-10-03 02:37:35,463 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:35,463 INFO L82 PathProgramCache]: Analyzing trace with hash 663424798, now seen corresponding path program 1 times [2019-10-03 02:37:35,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:35,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:35,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:35,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:35,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:35,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:35,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:35,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:37:35,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:35,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:37:35,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:37:35,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:37:35,646 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2019-10-03 02:37:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:35,830 INFO L93 Difference]: Finished difference Result 420 states and 531 transitions. [2019-10-03 02:37:35,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-03 02:37:35,831 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-10-03 02:37:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:35,834 INFO L225 Difference]: With dead ends: 420 [2019-10-03 02:37:35,834 INFO L226 Difference]: Without dead ends: 396 [2019-10-03 02:37:35,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:37:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-10-03 02:37:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2019-10-03 02:37:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-10-03 02:37:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2019-10-03 02:37:35,845 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2019-10-03 02:37:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:35,845 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2019-10-03 02:37:35,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:37:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2019-10-03 02:37:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-03 02:37:35,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:35,848 INFO L411 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-10-03 02:37:35,848 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:35,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:35,848 INFO L82 PathProgramCache]: Analyzing trace with hash 672856935, now seen corresponding path program 1 times [2019-10-03 02:37:35,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:35,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:35,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:35,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:35,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:36,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:36,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:37:36,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:36,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:37:36,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:37:36,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:37:36,035 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2019-10-03 02:37:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:38,111 INFO L93 Difference]: Finished difference Result 778 states and 984 transitions. [2019-10-03 02:37:38,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-03 02:37:38,111 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-10-03 02:37:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:38,116 INFO L225 Difference]: With dead ends: 778 [2019-10-03 02:37:38,116 INFO L226 Difference]: Without dead ends: 719 [2019-10-03 02:37:38,117 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2019-10-03 02:37:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-10-03 02:37:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 670. [2019-10-03 02:37:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-03 02:37:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 828 transitions. [2019-10-03 02:37:38,132 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 828 transitions. Word has length 120 [2019-10-03 02:37:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:38,132 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 828 transitions. [2019-10-03 02:37:38,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:37:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 828 transitions. [2019-10-03 02:37:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-03 02:37:38,134 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:38,135 INFO L411 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-10-03 02:37:38,135 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:38,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:38,135 INFO L82 PathProgramCache]: Analyzing trace with hash -365727639, now seen corresponding path program 1 times [2019-10-03 02:37:38,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:38,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:38,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:38,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:38,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:37:38,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:38,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:37:38,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:38,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:37:38,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:37:38,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:37:38,277 INFO L87 Difference]: Start difference. First operand 670 states and 828 transitions. Second operand 14 states. [2019-10-03 02:37:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:40,867 INFO L93 Difference]: Finished difference Result 678 states and 834 transitions. [2019-10-03 02:37:40,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-03 02:37:40,867 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-10-03 02:37:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:40,871 INFO L225 Difference]: With dead ends: 678 [2019-10-03 02:37:40,871 INFO L226 Difference]: Without dead ends: 617 [2019-10-03 02:37:40,871 INFO L640 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-10-03 02:37:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-03 02:37:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 275. [2019-10-03 02:37:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-03 02:37:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 327 transitions. [2019-10-03 02:37:40,890 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 327 transitions. Word has length 120 [2019-10-03 02:37:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:40,890 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 327 transitions. [2019-10-03 02:37:40,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:37:40,891 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 327 transitions. [2019-10-03 02:37:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-03 02:37:40,892 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:40,892 INFO L411 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-10-03 02:37:40,892 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash 147468031, now seen corresponding path program 1 times [2019-10-03 02:37:40,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:40,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:40,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:40,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:40,966 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-03 02:37:40,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:37:40,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:37:40,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:40,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:37:40,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:37:40,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:37:40,968 INFO L87 Difference]: Start difference. First operand 275 states and 327 transitions. Second operand 6 states. [2019-10-03 02:37:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:37:41,001 INFO L93 Difference]: Finished difference Result 322 states and 398 transitions. [2019-10-03 02:37:41,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:37:41,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-10-03 02:37:41,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:37:41,004 INFO L225 Difference]: With dead ends: 322 [2019-10-03 02:37:41,004 INFO L226 Difference]: Without dead ends: 322 [2019-10-03 02:37:41,004 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:37:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-03 02:37:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2019-10-03 02:37:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-03 02:37:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2019-10-03 02:37:41,012 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 121 [2019-10-03 02:37:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:37:41,012 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2019-10-03 02:37:41,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:37:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2019-10-03 02:37:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-03 02:37:41,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:37:41,014 INFO L411 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-10-03 02:37:41,015 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:37:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:41,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1256855655, now seen corresponding path program 1 times [2019-10-03 02:37:41,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:37:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:37:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:37:41,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:37:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:37:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-03 02:37:41,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:37:41,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:37:41,113 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-10-03 02:37:41,115 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-10-03 02:37:41,184 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:37:41,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:37:41,374 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:37:41,697 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:37:41,710 INFO L272 AbstractInterpreter]: Visited 88 different actions 208 times. Merged at 18 different actions 38 times. Never widened. Performed 1812 root evaluator evaluations with a maximum evaluation depth of 12. Performed 1812 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 2 fixpoints after 1 different actions. Largest state had 98 variables. [2019-10-03 02:37:41,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:37:41,717 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:37:42,053 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 85.01% of their original sizes. [2019-10-03 02:37:42,054 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:37:46,411 INFO L420 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2019-10-03 02:37:46,412 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:37:46,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:37:46,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [76] imperfect sequences [6] total 80 [2019-10-03 02:37:46,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:37:46,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-03 02:37:46,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-03 02:37:46,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=5426, Unknown=0, NotChecked=0, Total=5700 [2019-10-03 02:37:46,417 INFO L87 Difference]: Start difference. First operand 269 states and 314 transitions. Second operand 76 states. [2019-10-03 02:38:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:25,166 INFO L93 Difference]: Finished difference Result 371 states and 462 transitions. [2019-10-03 02:38:25,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-03 02:38:25,166 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 163 [2019-10-03 02:38:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:25,168 INFO L225 Difference]: With dead ends: 371 [2019-10-03 02:38:25,169 INFO L226 Difference]: Without dead ends: 369 [2019-10-03 02:38:25,175 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5381 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1173, Invalid=21779, Unknown=0, NotChecked=0, Total=22952 [2019-10-03 02:38:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-03 02:38:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 283. [2019-10-03 02:38:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-03 02:38:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 331 transitions. [2019-10-03 02:38:25,188 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 331 transitions. Word has length 163 [2019-10-03 02:38:25,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:25,188 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 331 transitions. [2019-10-03 02:38:25,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-10-03 02:38:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 331 transitions. [2019-10-03 02:38:25,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-03 02:38:25,190 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:25,191 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:25,191 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash -713455478, now seen corresponding path program 1 times [2019-10-03 02:38:25,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-03 02:38:25,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:25,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:25,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:25,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:25,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:25,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:25,312 INFO L87 Difference]: Start difference. First operand 283 states and 331 transitions. Second operand 6 states. [2019-10-03 02:38:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:25,358 INFO L93 Difference]: Finished difference Result 309 states and 368 transitions. [2019-10-03 02:38:25,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:25,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-10-03 02:38:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:25,361 INFO L225 Difference]: With dead ends: 309 [2019-10-03 02:38:25,361 INFO L226 Difference]: Without dead ends: 309 [2019-10-03 02:38:25,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:25,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-03 02:38:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 276. [2019-10-03 02:38:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-03 02:38:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 316 transitions. [2019-10-03 02:38:25,376 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 316 transitions. Word has length 164 [2019-10-03 02:38:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:25,377 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 316 transitions. [2019-10-03 02:38:25,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:25,377 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 316 transitions. [2019-10-03 02:38:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-03 02:38:25,380 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:25,381 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:25,381 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash -469124130, now seen corresponding path program 1 times [2019-10-03 02:38:25,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-10-03 02:38:25,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:25,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:25,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:25,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:25,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:25,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:25,542 INFO L87 Difference]: Start difference. First operand 276 states and 316 transitions. Second operand 6 states. [2019-10-03 02:38:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:25,578 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2019-10-03 02:38:25,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:25,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-10-03 02:38:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:25,580 INFO L225 Difference]: With dead ends: 261 [2019-10-03 02:38:25,581 INFO L226 Difference]: Without dead ends: 261 [2019-10-03 02:38:25,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-03 02:38:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 247. [2019-10-03 02:38:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-03 02:38:25,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 280 transitions. [2019-10-03 02:38:25,596 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 280 transitions. Word has length 204 [2019-10-03 02:38:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:25,596 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 280 transitions. [2019-10-03 02:38:25,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 280 transitions. [2019-10-03 02:38:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:38:25,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:38:25,599 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:38:25,600 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:38:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:38:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash 336725440, now seen corresponding path program 1 times [2019-10-03 02:38:25,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:38:25,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:38:25,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:38:25,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:38:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:38:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-10-03 02:38:25,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:38:25,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:38:25,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:38:25,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:38:25,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:38:25,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:38:25,816 INFO L87 Difference]: Start difference. First operand 247 states and 280 transitions. Second operand 6 states. [2019-10-03 02:38:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:38:25,840 INFO L93 Difference]: Finished difference Result 233 states and 262 transitions. [2019-10-03 02:38:25,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:38:25,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-10-03 02:38:25,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:38:25,841 INFO L225 Difference]: With dead ends: 233 [2019-10-03 02:38:25,841 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:38:25,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:38:25,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:38:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:38:25,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:38:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:38:25,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2019-10-03 02:38:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:38:25,843 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:38:25,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:38:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:38:25,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:38:25,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:38:25 BoogieIcfgContainer [2019-10-03 02:38:25,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:38:25,863 INFO L168 Benchmark]: Toolchain (without parser) took 73909.85 ms. Allocated memory was 131.1 MB in the beginning and 827.9 MB in the end (delta: 696.8 MB). Free memory was 84.9 MB in the beginning and 685.7 MB in the end (delta: -600.8 MB). Peak memory consumption was 96.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:25,864 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-03 02:38:25,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.95 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 84.7 MB in the beginning and 163.9 MB in the end (delta: -79.2 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:25,866 INFO L168 Benchmark]: Boogie Preprocessor took 78.02 ms. Allocated memory is still 198.7 MB. Free memory was 163.9 MB in the beginning and 160.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:25,867 INFO L168 Benchmark]: RCFGBuilder took 1162.88 ms. Allocated memory is still 198.7 MB. Free memory was 160.1 MB in the beginning and 74.7 MB in the end (delta: 85.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:25,868 INFO L168 Benchmark]: TraceAbstraction took 71986.04 ms. Allocated memory was 198.7 MB in the beginning and 827.9 MB in the end (delta: 629.1 MB). Free memory was 74.1 MB in the beginning and 685.7 MB in the end (delta: -611.6 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:38:25,871 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 131.1 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 676.95 ms. Allocated memory was 131.1 MB in the beginning and 198.7 MB in the end (delta: 67.6 MB). Free memory was 84.7 MB in the beginning and 163.9 MB in the end (delta: -79.2 MB). Peak memory consumption was 28.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.02 ms. Allocated memory is still 198.7 MB. Free memory was 163.9 MB in the beginning and 160.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1162.88 ms. Allocated memory is still 198.7 MB. Free memory was 160.1 MB in the beginning and 74.7 MB in the end (delta: 85.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71986.04 ms. Allocated memory was 198.7 MB in the beginning and 827.9 MB in the end (delta: 629.1 MB). Free memory was 74.1 MB in the beginning and 685.7 MB in the end (delta: -611.6 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 295 locations, 1 error locations. SAFE Result, 71.9s OverallTime, 49 OverallIterations, 4 TraceHistogramMax, 59.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14558 SDtfs, 10316 SDslu, 44432 SDs, 0 SdLazy, 25312 SolverSat, 2740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 777 GetRequests, 224 SyntacticMatches, 14 SemanticMatches, 539 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6016 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1043occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9646914365862156 AbsIntWeakeningRatio, 2.1419753086419755 AbsIntAvgWeakeningVarsNumRemoved, 13.530864197530864 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 49 MinimizatonAttempts, 2570 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 3497 NumberOfCodeBlocks, 3497 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3448 ConstructedInterpolants, 0 QuantifiedInterpolants, 521066 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 48 PerfectInterpolantSequences, 553/559 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...