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-efa34d5 [2019-09-16 17:04:23,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:23,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:23,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:23,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:23,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:23,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:23,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:23,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:23,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:23,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:23,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:23,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:23,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:23,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:23,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:23,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:23,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:23,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:23,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:23,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:23,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:23,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:23,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:23,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:23,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:23,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:23,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:23,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:23,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:23,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:23,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:23,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:23,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:23,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:23,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:23,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:23,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:23,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:23,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:23,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:23,646 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:04:23,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:23,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:23,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:23,661 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:23,662 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:23,662 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:23,662 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:23,663 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:23,663 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:23,663 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:23,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:23,664 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:23,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:23,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:23,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:23,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:23,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:23,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:23,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:23,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:23,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:23,666 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:23,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:23,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:23,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:23,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:23,667 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:23,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:23,667 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:23,668 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:23,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:23,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:23,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:23,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:23,725 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:23,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-09-16 17:04:23,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c25a8806/e3a0aa0913854ab8aeee4f4978b352d2/FLAG044a5e50a [2019-09-16 17:04:24,331 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:24,331 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-09-16 17:04:24,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c25a8806/e3a0aa0913854ab8aeee4f4978b352d2/FLAG044a5e50a [2019-09-16 17:04:24,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c25a8806/e3a0aa0913854ab8aeee4f4978b352d2 [2019-09-16 17:04:24,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:24,630 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:24,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:24,632 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:24,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:24,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:24" (1/1) ... [2019-09-16 17:04:24,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee27ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:24, skipping insertion in model container [2019-09-16 17:04:24,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:24" (1/1) ... [2019-09-16 17:04:24,645 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:24,703 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:25,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:25,179 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:25,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:25,343 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:25,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:25 WrapperNode [2019-09-16 17:04:25,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:25,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:25,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:25,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:25,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:25" (1/1) ... [2019-09-16 17:04:25,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:25" (1/1) ... [2019-09-16 17:04:25,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:25" (1/1) ... [2019-09-16 17:04:25,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:25" (1/1) ... [2019-09-16 17:04:25,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:25" (1/1) ... [2019-09-16 17:04:25,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:25" (1/1) ... [2019-09-16 17:04:25,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:25" (1/1) ... [2019-09-16 17:04:25,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:25,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:25,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:25,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:25,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:25,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:25,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:25,526 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2019-09-16 17:04:25,526 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2019-09-16 17:04:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2019-09-16 17:04:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2019-09-16 17:04:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2019-09-16 17:04:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2019-09-16 17:04:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2019-09-16 17:04:25,527 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2019-09-16 17:04:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2019-09-16 17:04:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2019-09-16 17:04:25,528 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2019-09-16 17:04:25,529 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2019-09-16 17:04:25,529 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2019-09-16 17:04:25,530 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2019-09-16 17:04:25,530 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2019-09-16 17:04:25,530 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2019-09-16 17:04:25,531 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2019-09-16 17:04:25,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:25,531 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2019-09-16 17:04:25,531 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2019-09-16 17:04:25,531 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2019-09-16 17:04:25,531 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2019-09-16 17:04:25,532 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2019-09-16 17:04:25,532 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2019-09-16 17:04:25,533 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2019-09-16 17:04:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:04:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:04:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:04:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2019-09-16 17:04:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2019-09-16 17:04:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2019-09-16 17:04:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2019-09-16 17:04:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2019-09-16 17:04:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2019-09-16 17:04:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2019-09-16 17:04:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2019-09-16 17:04:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2019-09-16 17:04:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2019-09-16 17:04:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2019-09-16 17:04:25,535 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2019-09-16 17:04:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2019-09-16 17:04:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2019-09-16 17:04:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2019-09-16 17:04:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2019-09-16 17:04:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2019-09-16 17:04:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2019-09-16 17:04:25,536 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2019-09-16 17:04:25,537 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2019-09-16 17:04:25,537 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2019-09-16 17:04:25,537 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2019-09-16 17:04:25,537 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2019-09-16 17:04:25,537 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:25,537 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2019-09-16 17:04:25,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:25,851 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:26,067 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-09-16 17:04:26,067 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-09-16 17:04:26,075 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:26,136 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2019-09-16 17:04:26,136 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2019-09-16 17:04:26,154 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:26,174 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2019-09-16 17:04:26,174 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2019-09-16 17:04:26,181 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:26,192 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2019-09-16 17:04:26,192 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2019-09-16 17:04:26,410 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:26,452 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2019-09-16 17:04:26,452 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2019-09-16 17:04:26,481 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:26,497 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2019-09-16 17:04:26,497 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2019-09-16 17:04:26,527 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:26,528 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:26,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:26 BoogieIcfgContainer [2019-09-16 17:04:26,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:26,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:26,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:26,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:26,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:24" (1/3) ... [2019-09-16 17:04:26,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb2dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:26, skipping insertion in model container [2019-09-16 17:04:26,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:25" (2/3) ... [2019-09-16 17:04:26,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb2dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:26, skipping insertion in model container [2019-09-16 17:04:26,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:26" (3/3) ... [2019-09-16 17:04:26,537 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-09-16 17:04:26,547 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:26,555 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:26,591 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:26,617 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:26,618 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:26,618 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:26,618 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:26,618 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:26,618 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:26,619 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:26,619 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states. [2019-09-16 17:04:26,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:26,652 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:26,653 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:26,656 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash -155432117, now seen corresponding path program 1 times [2019-09-16 17:04:26,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:26,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:26,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:26,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:26,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:26,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:26,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:26,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:26,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:26,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:26,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:26,944 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 3 states. [2019-09-16 17:04:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:27,092 INFO L93 Difference]: Finished difference Result 303 states and 411 transitions. [2019-09-16 17:04:27,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:27,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:27,112 INFO L225 Difference]: With dead ends: 303 [2019-09-16 17:04:27,112 INFO L226 Difference]: Without dead ends: 287 [2019-09-16 17:04:27,114 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-16 17:04:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-09-16 17:04:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-16 17:04:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2019-09-16 17:04:27,183 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2019-09-16 17:04:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:27,184 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2019-09-16 17:04:27,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2019-09-16 17:04:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:27,186 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:27,186 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:27,186 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:27,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:27,187 INFO L82 PathProgramCache]: Analyzing trace with hash -240124352, now seen corresponding path program 1 times [2019-09-16 17:04:27,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:27,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:27,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:27,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:27,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:27,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:27,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:27,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:27,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:27,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:27,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:27,326 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand 3 states. [2019-09-16 17:04:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:27,501 INFO L93 Difference]: Finished difference Result 455 states and 623 transitions. [2019-09-16 17:04:27,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:27,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:27,514 INFO L225 Difference]: With dead ends: 455 [2019-09-16 17:04:27,514 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:04:27,515 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:04:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 434. [2019-09-16 17:04:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-16 17:04:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 597 transitions. [2019-09-16 17:04:27,589 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 597 transitions. Word has length 25 [2019-09-16 17:04:27,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:27,590 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 597 transitions. [2019-09-16 17:04:27,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 597 transitions. [2019-09-16 17:04:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 17:04:27,595 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:27,595 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:27,596 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2018358777, now seen corresponding path program 1 times [2019-09-16 17:04:27,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:27,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:27,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:27,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:27,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:27,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:27,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:27,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:27,744 INFO L87 Difference]: Start difference. First operand 434 states and 597 transitions. Second operand 3 states. [2019-09-16 17:04:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:27,778 INFO L93 Difference]: Finished difference Result 646 states and 914 transitions. [2019-09-16 17:04:27,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:27,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 17:04:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:27,785 INFO L225 Difference]: With dead ends: 646 [2019-09-16 17:04:27,785 INFO L226 Difference]: Without dead ends: 646 [2019-09-16 17:04:27,786 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-16 17:04:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 606. [2019-09-16 17:04:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-09-16 17:04:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 867 transitions. [2019-09-16 17:04:27,832 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 867 transitions. Word has length 31 [2019-09-16 17:04:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:27,833 INFO L475 AbstractCegarLoop]: Abstraction has 606 states and 867 transitions. [2019-09-16 17:04:27,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 867 transitions. [2019-09-16 17:04:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 17:04:27,840 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:27,840 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:27,840 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1575744654, now seen corresponding path program 1 times [2019-09-16 17:04:27,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:27,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:27,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:27,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:27,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:27,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:27,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:27,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:27,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:27,969 INFO L87 Difference]: Start difference. First operand 606 states and 867 transitions. Second operand 3 states. [2019-09-16 17:04:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:28,051 INFO L93 Difference]: Finished difference Result 617 states and 882 transitions. [2019-09-16 17:04:28,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:28,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-09-16 17:04:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:28,078 INFO L225 Difference]: With dead ends: 617 [2019-09-16 17:04:28,078 INFO L226 Difference]: Without dead ends: 617 [2019-09-16 17:04:28,079 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-16 17:04:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 616. [2019-09-16 17:04:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-16 17:04:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 880 transitions. [2019-09-16 17:04:28,104 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 880 transitions. Word has length 36 [2019-09-16 17:04:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:28,105 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 880 transitions. [2019-09-16 17:04:28,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 880 transitions. [2019-09-16 17:04:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-16 17:04:28,106 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:28,106 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:28,107 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:28,107 INFO L82 PathProgramCache]: Analyzing trace with hash -113678377, now seen corresponding path program 1 times [2019-09-16 17:04:28,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:28,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:28,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:28,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:28,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:28,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:28,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:28,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:28,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:28,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:28,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:28,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:28,153 INFO L87 Difference]: Start difference. First operand 616 states and 880 transitions. Second operand 3 states. [2019-09-16 17:04:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:28,200 INFO L93 Difference]: Finished difference Result 1053 states and 1556 transitions. [2019-09-16 17:04:28,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:28,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-16 17:04:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:28,208 INFO L225 Difference]: With dead ends: 1053 [2019-09-16 17:04:28,208 INFO L226 Difference]: Without dead ends: 1053 [2019-09-16 17:04:28,208 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-16 17:04:28,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1023. [2019-09-16 17:04:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-09-16 17:04:28,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1524 transitions. [2019-09-16 17:04:28,254 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1524 transitions. Word has length 39 [2019-09-16 17:04:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:28,258 INFO L475 AbstractCegarLoop]: Abstraction has 1023 states and 1524 transitions. [2019-09-16 17:04:28,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1524 transitions. [2019-09-16 17:04:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-16 17:04:28,260 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:28,260 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:28,260 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:28,260 INFO L82 PathProgramCache]: Analyzing trace with hash -128023286, now seen corresponding path program 1 times [2019-09-16 17:04:28,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:28,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:28,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:28,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:28,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:28,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:28,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:28,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:28,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:28,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:28,308 INFO L87 Difference]: Start difference. First operand 1023 states and 1524 transitions. Second operand 3 states. [2019-09-16 17:04:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:28,417 INFO L93 Difference]: Finished difference Result 1045 states and 1547 transitions. [2019-09-16 17:04:28,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:28,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-16 17:04:28,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:28,426 INFO L225 Difference]: With dead ends: 1045 [2019-09-16 17:04:28,426 INFO L226 Difference]: Without dead ends: 1045 [2019-09-16 17:04:28,427 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-09-16 17:04:28,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2019-09-16 17:04:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-09-16 17:04:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1546 transitions. [2019-09-16 17:04:28,467 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1546 transitions. Word has length 39 [2019-09-16 17:04:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:28,467 INFO L475 AbstractCegarLoop]: Abstraction has 1043 states and 1546 transitions. [2019-09-16 17:04:28,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1546 transitions. [2019-09-16 17:04:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 17:04:28,468 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:28,469 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:28,469 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash 778971858, now seen corresponding path program 1 times [2019-09-16 17:04:28,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:28,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:28,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:28,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:28,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:28,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:28,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:04:28,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:28,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:04:28,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:04:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:28,538 INFO L87 Difference]: Start difference. First operand 1043 states and 1546 transitions. Second operand 5 states. [2019-09-16 17:04:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:28,579 INFO L93 Difference]: Finished difference Result 1055 states and 1561 transitions. [2019-09-16 17:04:28,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:04:28,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-09-16 17:04:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:28,588 INFO L225 Difference]: With dead ends: 1055 [2019-09-16 17:04:28,588 INFO L226 Difference]: Without dead ends: 1036 [2019-09-16 17:04:28,588 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:28,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-16 17:04:28,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1036. [2019-09-16 17:04:28,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-09-16 17:04:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1537 transitions. [2019-09-16 17:04:28,623 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1537 transitions. Word has length 40 [2019-09-16 17:04:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:28,623 INFO L475 AbstractCegarLoop]: Abstraction has 1036 states and 1537 transitions. [2019-09-16 17:04:28,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:04:28,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1537 transitions. [2019-09-16 17:04:28,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:04:28,625 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:28,625 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:28,625 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:28,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:28,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1897332428, now seen corresponding path program 1 times [2019-09-16 17:04:28,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:28,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:28,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:28,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:28,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:28,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:28,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:28,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:28,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:28,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:28,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:28,683 INFO L87 Difference]: Start difference. First operand 1036 states and 1537 transitions. Second operand 3 states. [2019-09-16 17:04:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:28,700 INFO L93 Difference]: Finished difference Result 578 states and 823 transitions. [2019-09-16 17:04:28,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:28,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-16 17:04:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:28,704 INFO L225 Difference]: With dead ends: 578 [2019-09-16 17:04:28,704 INFO L226 Difference]: Without dead ends: 578 [2019-09-16 17:04:28,705 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:28,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-16 17:04:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-09-16 17:04:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-16 17:04:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 823 transitions. [2019-09-16 17:04:28,726 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 823 transitions. Word has length 45 [2019-09-16 17:04:28,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:28,730 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 823 transitions. [2019-09-16 17:04:28,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 823 transitions. [2019-09-16 17:04:28,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-16 17:04:28,734 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:28,734 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:28,735 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:28,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:28,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1237576342, now seen corresponding path program 1 times [2019-09-16 17:04:28,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:28,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:28,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:28,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:28,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:28,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:28,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 17:04:28,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:28,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 17:04:28,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 17:04:28,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 17:04:28,870 INFO L87 Difference]: Start difference. First operand 578 states and 823 transitions. Second operand 10 states. [2019-09-16 17:04:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:29,722 INFO L93 Difference]: Finished difference Result 601 states and 848 transitions. [2019-09-16 17:04:29,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 17:04:29,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2019-09-16 17:04:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:29,727 INFO L225 Difference]: With dead ends: 601 [2019-09-16 17:04:29,727 INFO L226 Difference]: Without dead ends: 601 [2019-09-16 17:04:29,728 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-16 17:04:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-16 17:04:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-09-16 17:04:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-16 17:04:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 822 transitions. [2019-09-16 17:04:29,746 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 822 transitions. Word has length 44 [2019-09-16 17:04:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:29,747 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 822 transitions. [2019-09-16 17:04:29,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 17:04:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 822 transitions. [2019-09-16 17:04:29,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:04:29,748 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:29,748 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:29,749 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:29,749 INFO L82 PathProgramCache]: Analyzing trace with hash -599288098, now seen corresponding path program 1 times [2019-09-16 17:04:29,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:29,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:29,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:29,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:29,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 17:04:29,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:29,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 17:04:29,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 17:04:29,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 17:04:29,851 INFO L87 Difference]: Start difference. First operand 578 states and 822 transitions. Second operand 10 states. [2019-09-16 17:04:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:30,672 INFO L93 Difference]: Finished difference Result 601 states and 846 transitions. [2019-09-16 17:04:30,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 17:04:30,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-16 17:04:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:30,679 INFO L225 Difference]: With dead ends: 601 [2019-09-16 17:04:30,679 INFO L226 Difference]: Without dead ends: 601 [2019-09-16 17:04:30,679 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-09-16 17:04:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-09-16 17:04:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 578. [2019-09-16 17:04:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-16 17:04:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 821 transitions. [2019-09-16 17:04:30,707 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 821 transitions. Word has length 45 [2019-09-16 17:04:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:30,708 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 821 transitions. [2019-09-16 17:04:30,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 17:04:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 821 transitions. [2019-09-16 17:04:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-16 17:04:30,710 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:30,710 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:30,710 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1343021677, now seen corresponding path program 1 times [2019-09-16 17:04:30,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:30,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:30,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:30,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:30,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:04:30,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:30,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:04:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:04:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:30,775 INFO L87 Difference]: Start difference. First operand 578 states and 821 transitions. Second operand 6 states. [2019-09-16 17:04:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:30,838 INFO L93 Difference]: Finished difference Result 598 states and 843 transitions. [2019-09-16 17:04:30,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 17:04:30,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-09-16 17:04:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:30,844 INFO L225 Difference]: With dead ends: 598 [2019-09-16 17:04:30,844 INFO L226 Difference]: Without dead ends: 576 [2019-09-16 17:04:30,845 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-16 17:04:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-16 17:04:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-16 17:04:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 816 transitions. [2019-09-16 17:04:30,870 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 816 transitions. Word has length 46 [2019-09-16 17:04:30,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:30,871 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 816 transitions. [2019-09-16 17:04:30,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:04:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 816 transitions. [2019-09-16 17:04:30,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-16 17:04:30,872 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:30,872 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:30,873 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:30,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:30,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1289582749, now seen corresponding path program 1 times [2019-09-16 17:04:30,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:30,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:30,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:30,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:30,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:30,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:30,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:30,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:30,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:30,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:30,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:30,922 INFO L87 Difference]: Start difference. First operand 576 states and 816 transitions. Second operand 3 states. [2019-09-16 17:04:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:31,045 INFO L93 Difference]: Finished difference Result 802 states and 1192 transitions. [2019-09-16 17:04:31,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:31,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-16 17:04:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:31,052 INFO L225 Difference]: With dead ends: 802 [2019-09-16 17:04:31,053 INFO L226 Difference]: Without dead ends: 802 [2019-09-16 17:04:31,053 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-09-16 17:04:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 645. [2019-09-16 17:04:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-09-16 17:04:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 919 transitions. [2019-09-16 17:04:31,089 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 919 transitions. Word has length 46 [2019-09-16 17:04:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:31,090 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 919 transitions. [2019-09-16 17:04:31,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 919 transitions. [2019-09-16 17:04:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-16 17:04:31,091 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:31,091 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:31,092 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:31,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:31,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1266981467, now seen corresponding path program 1 times [2019-09-16 17:04:31,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:31,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:31,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:31,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:31,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:31,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:31,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:31,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:31,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:31,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:31,151 INFO L87 Difference]: Start difference. First operand 645 states and 919 transitions. Second operand 4 states. [2019-09-16 17:04:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:31,328 INFO L93 Difference]: Finished difference Result 452 states and 584 transitions. [2019-09-16 17:04:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:31,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-16 17:04:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:31,331 INFO L225 Difference]: With dead ends: 452 [2019-09-16 17:04:31,331 INFO L226 Difference]: Without dead ends: 452 [2019-09-16 17:04:31,332 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-16 17:04:31,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 431. [2019-09-16 17:04:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-09-16 17:04:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 563 transitions. [2019-09-16 17:04:31,346 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 563 transitions. Word has length 50 [2019-09-16 17:04:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:31,346 INFO L475 AbstractCegarLoop]: Abstraction has 431 states and 563 transitions. [2019-09-16 17:04:31,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 563 transitions. [2019-09-16 17:04:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-16 17:04:31,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:31,348 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:31,348 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:31,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:31,349 INFO L82 PathProgramCache]: Analyzing trace with hash -869356297, now seen corresponding path program 1 times [2019-09-16 17:04:31,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:31,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:31,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:31,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:31,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 17:04:31,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:31,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 17:04:31,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 17:04:31,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:04:31,417 INFO L87 Difference]: Start difference. First operand 431 states and 563 transitions. Second operand 8 states. [2019-09-16 17:04:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:31,593 INFO L93 Difference]: Finished difference Result 444 states and 579 transitions. [2019-09-16 17:04:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:04:31,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-16 17:04:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:31,596 INFO L225 Difference]: With dead ends: 444 [2019-09-16 17:04:31,596 INFO L226 Difference]: Without dead ends: 443 [2019-09-16 17:04:31,597 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:04:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-16 17:04:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 439. [2019-09-16 17:04:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-16 17:04:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 574 transitions. [2019-09-16 17:04:31,608 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 574 transitions. Word has length 47 [2019-09-16 17:04:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:31,608 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 574 transitions. [2019-09-16 17:04:31,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 17:04:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 574 transitions. [2019-09-16 17:04:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-16 17:04:31,609 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:31,610 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:31,610 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:31,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:31,610 INFO L82 PathProgramCache]: Analyzing trace with hash -869633127, now seen corresponding path program 1 times [2019-09-16 17:04:31,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:31,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:31,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:31,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:31,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 17:04:31,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:31,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 17:04:31,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 17:04:31,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:04:31,678 INFO L87 Difference]: Start difference. First operand 439 states and 574 transitions. Second operand 8 states. [2019-09-16 17:04:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:31,741 INFO L93 Difference]: Finished difference Result 477 states and 637 transitions. [2019-09-16 17:04:31,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:04:31,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-09-16 17:04:31,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:31,744 INFO L225 Difference]: With dead ends: 477 [2019-09-16 17:04:31,744 INFO L226 Difference]: Without dead ends: 462 [2019-09-16 17:04:31,745 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:04:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2019-09-16 17:04:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2019-09-16 17:04:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-16 17:04:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-09-16 17:04:31,757 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2019-09-16 17:04:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:31,758 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-09-16 17:04:31,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 17:04:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-09-16 17:04:31,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-16 17:04:31,759 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:31,759 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:31,760 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:31,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1156321742, now seen corresponding path program 1 times [2019-09-16 17:04:31,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:31,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-09-16 17:04:31,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:31,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-16 17:04:31,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:31,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 17:04:31,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 17:04:31,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-16 17:04:31,921 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 11 states. [2019-09-16 17:04:32,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:32,833 INFO L93 Difference]: Finished difference Result 490 states and 663 transitions. [2019-09-16 17:04:32,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 17:04:32,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-09-16 17:04:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:32,837 INFO L225 Difference]: With dead ends: 490 [2019-09-16 17:04:32,837 INFO L226 Difference]: Without dead ends: 475 [2019-09-16 17:04:32,838 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-16 17:04:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-16 17:04:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 449. [2019-09-16 17:04:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-16 17:04:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2019-09-16 17:04:32,851 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 48 [2019-09-16 17:04:32,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:32,851 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2019-09-16 17:04:32,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 17:04:32,851 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2019-09-16 17:04:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-16 17:04:32,852 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:32,853 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:32,853 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:32,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1551268366, now seen corresponding path program 1 times [2019-09-16 17:04:32,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:32,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:32,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:32,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:32,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:32,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:32,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:04:32,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:32,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:04:32,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:04:32,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:32,909 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand 5 states. [2019-09-16 17:04:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:33,578 INFO L93 Difference]: Finished difference Result 576 states and 789 transitions. [2019-09-16 17:04:33,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:04:33,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-16 17:04:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:33,582 INFO L225 Difference]: With dead ends: 576 [2019-09-16 17:04:33,582 INFO L226 Difference]: Without dead ends: 561 [2019-09-16 17:04:33,583 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-09-16 17:04:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 434. [2019-09-16 17:04:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-16 17:04:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 568 transitions. [2019-09-16 17:04:33,599 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 568 transitions. Word has length 48 [2019-09-16 17:04:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:33,599 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 568 transitions. [2019-09-16 17:04:33,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:04:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 568 transitions. [2019-09-16 17:04:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-16 17:04:33,600 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:33,601 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:33,601 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:33,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:33,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1985376582, now seen corresponding path program 1 times [2019-09-16 17:04:33,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:33,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:33,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:33,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:33,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 17:04:33,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:33,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 17:04:33,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 17:04:33,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:04:33,676 INFO L87 Difference]: Start difference. First operand 434 states and 568 transitions. Second operand 8 states. [2019-09-16 17:04:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:33,807 INFO L93 Difference]: Finished difference Result 445 states and 581 transitions. [2019-09-16 17:04:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:04:33,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-16 17:04:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:33,811 INFO L225 Difference]: With dead ends: 445 [2019-09-16 17:04:33,811 INFO L226 Difference]: Without dead ends: 417 [2019-09-16 17:04:33,811 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:04:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-16 17:04:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2019-09-16 17:04:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-09-16 17:04:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 547 transitions. [2019-09-16 17:04:33,822 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 547 transitions. Word has length 49 [2019-09-16 17:04:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:33,822 INFO L475 AbstractCegarLoop]: Abstraction has 417 states and 547 transitions. [2019-09-16 17:04:33,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 17:04:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 547 transitions. [2019-09-16 17:04:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-16 17:04:33,823 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:33,823 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:33,824 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:33,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1231576510, now seen corresponding path program 1 times [2019-09-16 17:04:33,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:33,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:33,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:33,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:33,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:04:33,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:33,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:04:33,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:04:33,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:33,883 INFO L87 Difference]: Start difference. First operand 417 states and 547 transitions. Second operand 6 states. [2019-09-16 17:04:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:33,915 INFO L93 Difference]: Finished difference Result 429 states and 560 transitions. [2019-09-16 17:04:33,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:04:33,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-09-16 17:04:33,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:33,921 INFO L225 Difference]: With dead ends: 429 [2019-09-16 17:04:33,921 INFO L226 Difference]: Without dead ends: 399 [2019-09-16 17:04:33,921 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:33,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-16 17:04:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-09-16 17:04:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-09-16 17:04:33,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 527 transitions. [2019-09-16 17:04:33,931 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 527 transitions. Word has length 50 [2019-09-16 17:04:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:33,931 INFO L475 AbstractCegarLoop]: Abstraction has 399 states and 527 transitions. [2019-09-16 17:04:33,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:04:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 527 transitions. [2019-09-16 17:04:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-16 17:04:33,934 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:33,934 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:33,935 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:33,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:33,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1270798393, now seen corresponding path program 1 times [2019-09-16 17:04:33,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:33,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:33,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:34,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:34,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 17:04:34,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:34,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 17:04:34,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 17:04:34,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:04:34,017 INFO L87 Difference]: Start difference. First operand 399 states and 527 transitions. Second operand 8 states. [2019-09-16 17:04:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:34,134 INFO L93 Difference]: Finished difference Result 426 states and 562 transitions. [2019-09-16 17:04:34,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:04:34,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-09-16 17:04:34,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:34,137 INFO L225 Difference]: With dead ends: 426 [2019-09-16 17:04:34,137 INFO L226 Difference]: Without dead ends: 408 [2019-09-16 17:04:34,138 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:04:34,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-16 17:04:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2019-09-16 17:04:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-16 17:04:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2019-09-16 17:04:34,148 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 50 [2019-09-16 17:04:34,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:34,148 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2019-09-16 17:04:34,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 17:04:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2019-09-16 17:04:34,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 17:04:34,149 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:34,149 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:34,149 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:34,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1229444274, now seen corresponding path program 1 times [2019-09-16 17:04:34,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:34,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:34,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:34,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:34,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:34,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:34,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:04:34,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:34,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:34,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:34,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:04:34,194 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2019-09-16 17:04:34,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:34,218 INFO L93 Difference]: Finished difference Result 410 states and 541 transitions. [2019-09-16 17:04:34,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:34,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-16 17:04:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:34,220 INFO L225 Difference]: With dead ends: 410 [2019-09-16 17:04:34,221 INFO L226 Difference]: Without dead ends: 410 [2019-09-16 17:04:34,221 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-16 17:04:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2019-09-16 17:04:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-09-16 17:04:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2019-09-16 17:04:34,231 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2019-09-16 17:04:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:34,231 INFO L475 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2019-09-16 17:04:34,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2019-09-16 17:04:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 17:04:34,232 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:34,232 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:34,232 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:34,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:34,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1071378316, now seen corresponding path program 1 times [2019-09-16 17:04:34,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:34,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:34,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:34,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:34,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:34,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:34,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-16 17:04:34,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:34,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 17:04:34,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 17:04:34,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:34,291 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2019-09-16 17:04:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:34,920 INFO L93 Difference]: Finished difference Result 511 states and 727 transitions. [2019-09-16 17:04:34,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 17:04:34,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-09-16 17:04:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:34,924 INFO L225 Difference]: With dead ends: 511 [2019-09-16 17:04:34,924 INFO L226 Difference]: Without dead ends: 511 [2019-09-16 17:04:34,925 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-16 17:04:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-09-16 17:04:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2019-09-16 17:04:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-09-16 17:04:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2019-09-16 17:04:34,937 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2019-09-16 17:04:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:34,938 INFO L475 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2019-09-16 17:04:34,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 17:04:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2019-09-16 17:04:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-16 17:04:34,939 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:34,939 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:34,939 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:34,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:34,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1218071118, now seen corresponding path program 1 times [2019-09-16 17:04:34,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:34,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:34,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:34,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:34,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:34,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:34,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:34,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:34,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:34,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:34,973 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2019-09-16 17:04:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:35,054 INFO L93 Difference]: Finished difference Result 659 states and 990 transitions. [2019-09-16 17:04:35,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:35,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-09-16 17:04:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:35,059 INFO L225 Difference]: With dead ends: 659 [2019-09-16 17:04:35,059 INFO L226 Difference]: Without dead ends: 659 [2019-09-16 17:04:35,060 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:35,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-09-16 17:04:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2019-09-16 17:04:35,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-16 17:04:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2019-09-16 17:04:35,078 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2019-09-16 17:04:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:35,078 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2019-09-16 17:04:35,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2019-09-16 17:04:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-16 17:04:35,079 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:35,079 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:35,079 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:35,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash -441774578, now seen corresponding path program 1 times [2019-09-16 17:04:35,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:35,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:35,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:35,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:35,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 17:04:35,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:35,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 17:04:35,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 17:04:35,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:04:35,149 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2019-09-16 17:04:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:35,194 INFO L93 Difference]: Finished difference Result 595 states and 867 transitions. [2019-09-16 17:04:35,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:04:35,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-09-16 17:04:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:35,198 INFO L225 Difference]: With dead ends: 595 [2019-09-16 17:04:35,198 INFO L226 Difference]: Without dead ends: 574 [2019-09-16 17:04:35,199 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:04:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-16 17:04:35,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-09-16 17:04:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-09-16 17:04:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2019-09-16 17:04:35,215 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2019-09-16 17:04:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:35,216 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2019-09-16 17:04:35,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 17:04:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2019-09-16 17:04:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 17:04:35,217 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:35,217 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:35,217 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:35,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:35,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1902483133, now seen corresponding path program 1 times [2019-09-16 17:04:35,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:35,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:35,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:35,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-09-16 17:04:35,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:35,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-16 17:04:35,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:35,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 17:04:35,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 17:04:35,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-16 17:04:35,340 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 11 states. [2019-09-16 17:04:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,027 INFO L93 Difference]: Finished difference Result 594 states and 865 transitions. [2019-09-16 17:04:36,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-16 17:04:36,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-09-16 17:04:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,031 INFO L225 Difference]: With dead ends: 594 [2019-09-16 17:04:36,031 INFO L226 Difference]: Without dead ends: 573 [2019-09-16 17:04:36,032 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2019-09-16 17:04:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-09-16 17:04:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-09-16 17:04:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-16 17:04:36,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 842 transitions. [2019-09-16 17:04:36,050 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 842 transitions. Word has length 53 [2019-09-16 17:04:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,050 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 842 transitions. [2019-09-16 17:04:36,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 17:04:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 842 transitions. [2019-09-16 17:04:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-16 17:04:36,051 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,051 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,051 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,052 INFO L82 PathProgramCache]: Analyzing trace with hash 315899517, now seen corresponding path program 1 times [2019-09-16 17:04:36,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:36,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:04:36,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:04:36,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:04:36,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:36,103 INFO L87 Difference]: Start difference. First operand 573 states and 842 transitions. Second operand 5 states. [2019-09-16 17:04:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,556 INFO L93 Difference]: Finished difference Result 655 states and 982 transitions. [2019-09-16 17:04:36,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:04:36,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-09-16 17:04:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,560 INFO L225 Difference]: With dead ends: 655 [2019-09-16 17:04:36,560 INFO L226 Difference]: Without dead ends: 624 [2019-09-16 17:04:36,561 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-16 17:04:36,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2019-09-16 17:04:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-09-16 17:04:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2019-09-16 17:04:36,579 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2019-09-16 17:04:36,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,579 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2019-09-16 17:04:36,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:04:36,579 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2019-09-16 17:04:36,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-16 17:04:36,580 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,580 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,581 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1255987189, now seen corresponding path program 1 times [2019-09-16 17:04:36,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,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-09-16 17:04:36,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:36,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:36,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:36,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,646 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2019-09-16 17:04:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,684 INFO L93 Difference]: Finished difference Result 527 states and 773 transitions. [2019-09-16 17:04:36,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:36,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-09-16 17:04:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,690 INFO L225 Difference]: With dead ends: 527 [2019-09-16 17:04:36,690 INFO L226 Difference]: Without dead ends: 527 [2019-09-16 17:04:36,690 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-16 17:04:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2019-09-16 17:04:36,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-09-16 17:04:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2019-09-16 17:04:36,705 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2019-09-16 17:04:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,705 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2019-09-16 17:04:36,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2019-09-16 17:04:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-16 17:04:36,706 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,706 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,707 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1573979395, now seen corresponding path program 1 times [2019-09-16 17:04:36,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:36,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 17:04:36,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 17:04:36,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 17:04:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 17:04:36,804 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2019-09-16 17:04:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,951 INFO L93 Difference]: Finished difference Result 526 states and 771 transitions. [2019-09-16 17:04:36,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 17:04:36,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2019-09-16 17:04:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,956 INFO L225 Difference]: With dead ends: 526 [2019-09-16 17:04:36,956 INFO L226 Difference]: Without dead ends: 466 [2019-09-16 17:04:36,956 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-16 17:04:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-09-16 17:04:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-09-16 17:04:36,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-16 17:04:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2019-09-16 17:04:36,973 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2019-09-16 17:04:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,974 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2019-09-16 17:04:36,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 17:04:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2019-09-16 17:04:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-16 17:04:36,975 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,975 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,975 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2092051162, now seen corresponding path program 1 times [2019-09-16 17:04:36,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:04:37,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:04:37,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:04:37,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:37,041 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2019-09-16 17:04:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,082 INFO L93 Difference]: Finished difference Result 497 states and 782 transitions. [2019-09-16 17:04:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:04:37,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-09-16 17:04:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,086 INFO L225 Difference]: With dead ends: 497 [2019-09-16 17:04:37,086 INFO L226 Difference]: Without dead ends: 497 [2019-09-16 17:04:37,086 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-09-16 17:04:37,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 481. [2019-09-16 17:04:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-16 17:04:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 750 transitions. [2019-09-16 17:04:37,101 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 750 transitions. Word has length 62 [2019-09-16 17:04:37,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,101 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 750 transitions. [2019-09-16 17:04:37,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:04:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 750 transitions. [2019-09-16 17:04:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:04:37,102 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,102 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,103 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1395701921, now seen corresponding path program 1 times [2019-09-16 17:04:37,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:37,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:37,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:37,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,143 INFO L87 Difference]: Start difference. First operand 481 states and 750 transitions. Second operand 3 states. [2019-09-16 17:04:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:37,206 INFO L93 Difference]: Finished difference Result 732 states and 1194 transitions. [2019-09-16 17:04:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:37,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-16 17:04:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:37,211 INFO L225 Difference]: With dead ends: 732 [2019-09-16 17:04:37,211 INFO L226 Difference]: Without dead ends: 732 [2019-09-16 17:04:37,212 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-09-16 17:04:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 487. [2019-09-16 17:04:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-09-16 17:04:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 759 transitions. [2019-09-16 17:04:37,232 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 759 transitions. Word has length 63 [2019-09-16 17:04:37,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:37,233 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 759 transitions. [2019-09-16 17:04:37,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 759 transitions. [2019-09-16 17:04:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:04:37,234 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:37,234 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:37,234 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:37,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1133247993, now seen corresponding path program 1 times [2019-09-16 17:04:37,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:37,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:37,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:37,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:37,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:37,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-16 17:04:37,378 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-16 17:04:37,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-16 17:04:37,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:04:37,379 INFO L87 Difference]: Start difference. First operand 487 states and 759 transitions. Second operand 9 states. [2019-09-16 17:04:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,259 INFO L93 Difference]: Finished difference Result 786 states and 1387 transitions. [2019-09-16 17:04:38,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 17:04:38,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-09-16 17:04:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,265 INFO L225 Difference]: With dead ends: 786 [2019-09-16 17:04:38,266 INFO L226 Difference]: Without dead ends: 786 [2019-09-16 17:04:38,266 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-16 17:04:38,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-16 17:04:38,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 516. [2019-09-16 17:04:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-09-16 17:04:38,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 826 transitions. [2019-09-16 17:04:38,289 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 826 transitions. Word has length 65 [2019-09-16 17:04:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,290 INFO L475 AbstractCegarLoop]: Abstraction has 516 states and 826 transitions. [2019-09-16 17:04:38,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-16 17:04:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 826 transitions. [2019-09-16 17:04:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-16 17:04:38,291 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,291 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,291 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,291 INFO L82 PathProgramCache]: Analyzing trace with hash -303975472, now seen corresponding path program 1 times [2019-09-16 17:04:38,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:04:38,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:04:38,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:04:38,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:38,422 INFO L87 Difference]: Start difference. First operand 516 states and 826 transitions. Second operand 6 states. [2019-09-16 17:04:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,455 INFO L93 Difference]: Finished difference Result 335 states and 482 transitions. [2019-09-16 17:04:38,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:04:38,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-09-16 17:04:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,458 INFO L225 Difference]: With dead ends: 335 [2019-09-16 17:04:38,458 INFO L226 Difference]: Without dead ends: 335 [2019-09-16 17:04:38,459 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-16 17:04:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2019-09-16 17:04:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2019-09-16 17:04:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 482 transitions. [2019-09-16 17:04:38,469 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 482 transitions. Word has length 65 [2019-09-16 17:04:38,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,469 INFO L475 AbstractCegarLoop]: Abstraction has 335 states and 482 transitions. [2019-09-16 17:04:38,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:04:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 482 transitions. [2019-09-16 17:04:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-16 17:04:38,470 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,471 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,471 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1801004585, now seen corresponding path program 1 times [2019-09-16 17:04:38,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:38,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:38,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:04:38,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:38,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:04:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:04:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:38,566 INFO L87 Difference]: Start difference. First operand 335 states and 482 transitions. Second operand 5 states. [2019-09-16 17:04:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,926 INFO L93 Difference]: Finished difference Result 310 states and 423 transitions. [2019-09-16 17:04:38,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:04:38,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-16 17:04:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,928 INFO L225 Difference]: With dead ends: 310 [2019-09-16 17:04:38,928 INFO L226 Difference]: Without dead ends: 310 [2019-09-16 17:04:38,928 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-16 17:04:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-09-16 17:04:38,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-16 17:04:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2019-09-16 17:04:38,935 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 69 [2019-09-16 17:04:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,936 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2019-09-16 17:04:38,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:04:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2019-09-16 17:04:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-16 17:04:38,937 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,937 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,937 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,937 INFO L82 PathProgramCache]: Analyzing trace with hash -671634044, now seen corresponding path program 1 times [2019-09-16 17:04:38,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:39,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:39,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-16 17:04:39,091 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:39,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 17:04:39,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 17:04:39,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-16 17:04:39,092 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 11 states. [2019-09-16 17:04:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:39,878 INFO L93 Difference]: Finished difference Result 384 states and 543 transitions. [2019-09-16 17:04:39,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 17:04:39,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2019-09-16 17:04:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:39,884 INFO L225 Difference]: With dead ends: 384 [2019-09-16 17:04:39,884 INFO L226 Difference]: Without dead ends: 384 [2019-09-16 17:04:39,885 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-09-16 17:04:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-16 17:04:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 307. [2019-09-16 17:04:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-16 17:04:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2019-09-16 17:04:39,896 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 70 [2019-09-16 17:04:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:39,896 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2019-09-16 17:04:39,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 17:04:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2019-09-16 17:04:39,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-16 17:04:39,898 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:39,898 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:39,898 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:39,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1051957894, now seen corresponding path program 1 times [2019-09-16 17:04:39,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:39,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:39,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:40,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:40,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:04:40,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:40,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:04:40,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:04:40,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:40,008 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2019-09-16 17:04:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:40,470 INFO L93 Difference]: Finished difference Result 407 states and 555 transitions. [2019-09-16 17:04:40,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:04:40,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-09-16 17:04:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:40,473 INFO L225 Difference]: With dead ends: 407 [2019-09-16 17:04:40,473 INFO L226 Difference]: Without dead ends: 407 [2019-09-16 17:04:40,473 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:04:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-09-16 17:04:40,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2019-09-16 17:04:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-16 17:04:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2019-09-16 17:04:40,484 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2019-09-16 17:04:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:40,485 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2019-09-16 17:04:40,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:04:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2019-09-16 17:04:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-16 17:04:40,486 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:40,486 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:40,486 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:40,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:40,486 INFO L82 PathProgramCache]: Analyzing trace with hash 59211627, now seen corresponding path program 1 times [2019-09-16 17:04:40,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:40,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:40,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:40,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:40,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:04:40,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:40,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:04:40,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:04:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:40,564 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2019-09-16 17:04:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:40,595 INFO L93 Difference]: Finished difference Result 369 states and 502 transitions. [2019-09-16 17:04:40,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:04:40,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-16 17:04:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:40,597 INFO L225 Difference]: With dead ends: 369 [2019-09-16 17:04:40,598 INFO L226 Difference]: Without dead ends: 369 [2019-09-16 17:04:40,598 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-16 17:04:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-09-16 17:04:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-16 17:04:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2019-09-16 17:04:40,607 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2019-09-16 17:04:40,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:40,608 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2019-09-16 17:04:40,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:04:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2019-09-16 17:04:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:04:40,609 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:40,609 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:40,609 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:40,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:40,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1688145691, now seen corresponding path program 1 times [2019-09-16 17:04:40,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:40,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:40,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:40,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:40,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:04:40,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:40,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:04:40,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:04:40,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:40,694 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2019-09-16 17:04:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:41,141 INFO L93 Difference]: Finished difference Result 337 states and 446 transitions. [2019-09-16 17:04:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-16 17:04:41,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-16 17:04:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:41,145 INFO L225 Difference]: With dead ends: 337 [2019-09-16 17:04:41,145 INFO L226 Difference]: Without dead ends: 337 [2019-09-16 17:04:41,146 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-16 17:04:41,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2019-09-16 17:04:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-09-16 17:04:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2019-09-16 17:04:41,157 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2019-09-16 17:04:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:41,160 INFO L475 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2019-09-16 17:04:41,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:04:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2019-09-16 17:04:41,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-16 17:04:41,163 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:41,163 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:41,164 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:41,164 INFO L82 PathProgramCache]: Analyzing trace with hash 404145100, now seen corresponding path program 1 times [2019-09-16 17:04:41,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:41,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:41,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:41,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-16 17:04:41,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:41,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-16 17:04:41,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-16 17:04:41,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-16 17:04:41,359 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2019-09-16 17:04:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:41,510 INFO L93 Difference]: Finished difference Result 354 states and 462 transitions. [2019-09-16 17:04:41,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-16 17:04:41,510 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2019-09-16 17:04:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:41,512 INFO L225 Difference]: With dead ends: 354 [2019-09-16 17:04:41,512 INFO L226 Difference]: Without dead ends: 332 [2019-09-16 17:04:41,513 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-16 17:04:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-16 17:04:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2019-09-16 17:04:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-16 17:04:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2019-09-16 17:04:41,520 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2019-09-16 17:04:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:41,521 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2019-09-16 17:04:41,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-16 17:04:41,521 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2019-09-16 17:04:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:04:41,523 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:41,523 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:41,523 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash 558183389, now seen corresponding path program 1 times [2019-09-16 17:04:41,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:41,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:41,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:41,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:41,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:04:41,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:41,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:04:41,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:04:41,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:41,592 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2019-09-16 17:04:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:41,966 INFO L93 Difference]: Finished difference Result 458 states and 578 transitions. [2019-09-16 17:04:41,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:04:41,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-16 17:04:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:41,970 INFO L225 Difference]: With dead ends: 458 [2019-09-16 17:04:41,970 INFO L226 Difference]: Without dead ends: 458 [2019-09-16 17:04:41,971 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-16 17:04:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2019-09-16 17:04:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-09-16 17:04:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2019-09-16 17:04:41,983 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2019-09-16 17:04:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:41,983 INFO L475 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2019-09-16 17:04:41,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:04:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2019-09-16 17:04:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:04:41,986 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:41,987 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:41,987 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:41,988 INFO L82 PathProgramCache]: Analyzing trace with hash -717142946, now seen corresponding path program 1 times [2019-09-16 17:04:41,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:41,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:42,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:42,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:42,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:42,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:42,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-16 17:04:42,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:42,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 17:04:42,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 17:04:42,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-16 17:04:42,226 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2019-09-16 17:04:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:44,172 INFO L93 Difference]: Finished difference Result 813 states and 1032 transitions. [2019-09-16 17:04:44,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-16 17:04:44,173 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-09-16 17:04:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:44,176 INFO L225 Difference]: With dead ends: 813 [2019-09-16 17:04:44,176 INFO L226 Difference]: Without dead ends: 774 [2019-09-16 17:04:44,177 INFO L636 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-09-16 17:04:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-09-16 17:04:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 521. [2019-09-16 17:04:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-09-16 17:04:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 639 transitions. [2019-09-16 17:04:44,190 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 639 transitions. Word has length 103 [2019-09-16 17:04:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:44,190 INFO L475 AbstractCegarLoop]: Abstraction has 521 states and 639 transitions. [2019-09-16 17:04:44,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 17:04:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 639 transitions. [2019-09-16 17:04:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-16 17:04:44,191 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:44,192 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:44,192 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash -745643236, now seen corresponding path program 1 times [2019-09-16 17:04:44,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:44,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:44,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:44,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:44,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:44,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:44,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-16 17:04:44,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:44,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 17:04:44,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 17:04:44,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-16 17:04:44,336 INFO L87 Difference]: Start difference. First operand 521 states and 639 transitions. Second operand 14 states. [2019-09-16 17:04:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,007 INFO L93 Difference]: Finished difference Result 794 states and 1009 transitions. [2019-09-16 17:04:47,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-16 17:04:47,007 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2019-09-16 17:04:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,011 INFO L225 Difference]: With dead ends: 794 [2019-09-16 17:04:47,011 INFO L226 Difference]: Without dead ends: 755 [2019-09-16 17:04:47,012 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-09-16 17:04:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-16 17:04:47,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 388. [2019-09-16 17:04:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-16 17:04:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2019-09-16 17:04:47,025 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2019-09-16 17:04:47,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,025 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2019-09-16 17:04:47,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 17:04:47,025 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2019-09-16 17:04:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-16 17:04:47,026 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,026 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:47,027 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash 663424798, now seen corresponding path program 1 times [2019-09-16 17:04:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:47,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-16 17:04:47,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-16 17:04:47,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-16 17:04:47,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-16 17:04:47,189 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2019-09-16 17:04:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,348 INFO L93 Difference]: Finished difference Result 420 states and 531 transitions. [2019-09-16 17:04:47,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-16 17:04:47,353 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2019-09-16 17:04:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,356 INFO L225 Difference]: With dead ends: 420 [2019-09-16 17:04:47,357 INFO L226 Difference]: Without dead ends: 396 [2019-09-16 17:04:47,357 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-16 17:04:47,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-09-16 17:04:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2019-09-16 17:04:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-09-16 17:04:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2019-09-16 17:04:47,366 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2019-09-16 17:04:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,367 INFO L475 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2019-09-16 17:04:47,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-16 17:04:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2019-09-16 17:04:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-16 17:04:47,369 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,369 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:47,369 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash 672856935, now seen corresponding path program 1 times [2019-09-16 17:04:47,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,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-09-16 17:04:47,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-16 17:04:47,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 17:04:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 17:04:47,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-16 17:04:47,575 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2019-09-16 17:04:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,536 INFO L93 Difference]: Finished difference Result 778 states and 984 transitions. [2019-09-16 17:04:49,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-16 17:04:49,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-09-16 17:04:49,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,541 INFO L225 Difference]: With dead ends: 778 [2019-09-16 17:04:49,541 INFO L226 Difference]: Without dead ends: 719 [2019-09-16 17:04:49,542 INFO L636 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-09-16 17:04:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-09-16 17:04:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 670. [2019-09-16 17:04:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-16 17:04:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 828 transitions. [2019-09-16 17:04:49,558 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 828 transitions. Word has length 120 [2019-09-16 17:04:49,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,558 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 828 transitions. [2019-09-16 17:04:49,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 17:04:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 828 transitions. [2019-09-16 17:04:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-16 17:04:49,560 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,561 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:49,561 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash -365727639, now seen corresponding path program 1 times [2019-09-16 17:04:49,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:49,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-16 17:04:49,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-16 17:04:49,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-16 17:04:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-16 17:04:49,703 INFO L87 Difference]: Start difference. First operand 670 states and 828 transitions. Second operand 14 states. [2019-09-16 17:04:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,091 INFO L93 Difference]: Finished difference Result 678 states and 834 transitions. [2019-09-16 17:04:52,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-16 17:04:52,092 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-09-16 17:04:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,096 INFO L225 Difference]: With dead ends: 678 [2019-09-16 17:04:52,096 INFO L226 Difference]: Without dead ends: 617 [2019-09-16 17:04:52,096 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2019-09-16 17:04:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-16 17:04:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 275. [2019-09-16 17:04:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-09-16 17:04:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 327 transitions. [2019-09-16 17:04:52,106 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 327 transitions. Word has length 120 [2019-09-16 17:04:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,106 INFO L475 AbstractCegarLoop]: Abstraction has 275 states and 327 transitions. [2019-09-16 17:04:52,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-16 17:04:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 327 transitions. [2019-09-16 17:04:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-16 17:04:52,108 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,108 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,108 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,109 INFO L82 PathProgramCache]: Analyzing trace with hash 147468031, now seen corresponding path program 1 times [2019-09-16 17:04:52,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-16 17:04:52,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:04:52,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:04:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:04:52,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:52,185 INFO L87 Difference]: Start difference. First operand 275 states and 327 transitions. Second operand 6 states. [2019-09-16 17:04:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,215 INFO L93 Difference]: Finished difference Result 322 states and 398 transitions. [2019-09-16 17:04:52,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:04:52,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-16 17:04:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,217 INFO L225 Difference]: With dead ends: 322 [2019-09-16 17:04:52,217 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 17:04:52,218 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:52,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 17:04:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2019-09-16 17:04:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-09-16 17:04:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2019-09-16 17:04:52,224 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 121 [2019-09-16 17:04:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,225 INFO L475 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2019-09-16 17:04:52,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:04:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2019-09-16 17:04:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-16 17:04:52,227 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,227 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,227 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1256855655, now seen corresponding path program 1 times [2019-09-16 17:04:52,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:04:52,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:52,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:52,305 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2019-09-16 17:04:52,309 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [17], [22], [27], [30], [161], [162], [165], [170], [296], [301], [305], [308], [313], [316], [317], [318], [319], [320], [333], [335], [338], [342], [348], [354], [356], [358], [365], [367], [368], [369], [371], [375], [377], [384], [388], [392], [394], [398], [400], [407], [409], [434], [438], [484], [537], [542], [544], [545], [546], [549], [552], [554], [560], [563], [571], [574], [576], [581], [584], [588], [596], [599], [602], [604], [615], [616], [661], [664], [686], [687], [695], [696], [697], [698], [703], [735], [741], [742], [743], [744], [745], [746], [747], [753], [754], [757], [758], [759], [760], [763], [764], [765], [766], [793], [794], [795], [796], [799], [800], [805], [811], [812], [813] [2019-09-16 17:04:52,360 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:04:52,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:04:52,516 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-16 17:04:52,785 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:04:52,787 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-09-16 17:04:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,792 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:04:53,030 INFO L227 lantSequenceWeakener]: Weakened 109 states. On average, predicates are now at 85.01% of their original sizes. [2019-09-16 17:04:53,030 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:04:57,041 INFO L420 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2019-09-16 17:04:57,041 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:04:57,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:04:57,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [76] imperfect sequences [6] total 80 [2019-09-16 17:04:57,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:57,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-16 17:04:57,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-16 17:04:57,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=5426, Unknown=0, NotChecked=0, Total=5700 [2019-09-16 17:04:57,046 INFO L87 Difference]: Start difference. First operand 269 states and 314 transitions. Second operand 76 states. [2019-09-16 17:05:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,453 INFO L93 Difference]: Finished difference Result 371 states and 462 transitions. [2019-09-16 17:05:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-16 17:05:32,453 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 163 [2019-09-16 17:05:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,470 INFO L225 Difference]: With dead ends: 371 [2019-09-16 17:05:32,470 INFO L226 Difference]: Without dead ends: 369 [2019-09-16 17:05:32,477 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5381 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1173, Invalid=21779, Unknown=0, NotChecked=0, Total=22952 [2019-09-16 17:05:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-16 17:05:32,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 283. [2019-09-16 17:05:32,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-16 17:05:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 331 transitions. [2019-09-16 17:05:32,493 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 331 transitions. Word has length 163 [2019-09-16 17:05:32,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,493 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 331 transitions. [2019-09-16 17:05:32,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-16 17:05:32,494 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 331 transitions. [2019-09-16 17:05:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-16 17:05:32,497 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,497 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:32,498 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,499 INFO L82 PathProgramCache]: Analyzing trace with hash -713455478, now seen corresponding path program 1 times [2019-09-16 17:05:32,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-16 17:05:32,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:32,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:32,613 INFO L87 Difference]: Start difference. First operand 283 states and 331 transitions. Second operand 6 states. [2019-09-16 17:05:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,659 INFO L93 Difference]: Finished difference Result 309 states and 368 transitions. [2019-09-16 17:05:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:32,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-09-16 17:05:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,662 INFO L225 Difference]: With dead ends: 309 [2019-09-16 17:05:32,663 INFO L226 Difference]: Without dead ends: 309 [2019-09-16 17:05:32,663 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:05:32,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-16 17:05:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 276. [2019-09-16 17:05:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-16 17:05:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 316 transitions. [2019-09-16 17:05:32,691 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 316 transitions. Word has length 164 [2019-09-16 17:05:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,692 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 316 transitions. [2019-09-16 17:05:32,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 316 transitions. [2019-09-16 17:05:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-16 17:05:32,696 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,696 INFO L407 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-09-16 17:05:32,697 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash -469124130, now seen corresponding path program 1 times [2019-09-16 17:05:32,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-16 17:05:32,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:32,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:32,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:32,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:32,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:32,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:32,899 INFO L87 Difference]: Start difference. First operand 276 states and 316 transitions. Second operand 6 states. [2019-09-16 17:05:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:32,936 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2019-09-16 17:05:32,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:32,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-09-16 17:05:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:32,938 INFO L225 Difference]: With dead ends: 261 [2019-09-16 17:05:32,938 INFO L226 Difference]: Without dead ends: 261 [2019-09-16 17:05:32,939 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:05:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-16 17:05:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 247. [2019-09-16 17:05:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-16 17:05:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 280 transitions. [2019-09-16 17:05:32,949 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 280 transitions. Word has length 204 [2019-09-16 17:05:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:32,950 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 280 transitions. [2019-09-16 17:05:32,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:32,950 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 280 transitions. [2019-09-16 17:05:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-16 17:05:32,955 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:32,956 INFO L407 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-09-16 17:05:32,956 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash 336725440, now seen corresponding path program 1 times [2019-09-16 17:05:32,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:32,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:32,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:32,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-16 17:05:33,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:33,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:05:33,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:33,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:05:33,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:05:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:05:33,224 INFO L87 Difference]: Start difference. First operand 247 states and 280 transitions. Second operand 6 states. [2019-09-16 17:05:33,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:33,261 INFO L93 Difference]: Finished difference Result 233 states and 262 transitions. [2019-09-16 17:05:33,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:05:33,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-09-16 17:05:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:33,262 INFO L225 Difference]: With dead ends: 233 [2019-09-16 17:05:33,262 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:05:33,263 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:05:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:05:33,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:05:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:05:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:05:33,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2019-09-16 17:05:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:33,267 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:05:33,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:05:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:05:33,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:05:33,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:33 BoogieIcfgContainer [2019-09-16 17:05:33,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:33,279 INFO L168 Benchmark]: Toolchain (without parser) took 68648.24 ms. Allocated memory was 131.1 MB in the beginning and 816.8 MB in the end (delta: 685.8 MB). Free memory was 85.4 MB in the beginning and 697.9 MB in the end (delta: -612.5 MB). Peak memory consumption was 73.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:33,280 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 131.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:05:33,280 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.88 ms. Allocated memory was 131.1 MB in the beginning and 199.2 MB in the end (delta: 68.2 MB). Free memory was 85.2 MB in the beginning and 163.9 MB in the end (delta: -78.7 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:33,281 INFO L168 Benchmark]: Boogie Preprocessor took 119.57 ms. Allocated memory is still 199.2 MB. Free memory was 163.9 MB in the beginning and 160.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:33,284 INFO L168 Benchmark]: RCFGBuilder took 1064.17 ms. Allocated memory is still 199.2 MB. Free memory was 159.9 MB in the beginning and 75.9 MB in the end (delta: 84.0 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:33,285 INFO L168 Benchmark]: TraceAbstraction took 66745.45 ms. Allocated memory was 199.2 MB in the beginning and 816.8 MB in the end (delta: 617.6 MB). Free memory was 75.3 MB in the beginning and 697.9 MB in the end (delta: -622.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-16 17:05:33,297 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.22 ms. Allocated memory is still 131.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.88 ms. Allocated memory was 131.1 MB in the beginning and 199.2 MB in the end (delta: 68.2 MB). Free memory was 85.2 MB in the beginning and 163.9 MB in the end (delta: -78.7 MB). Peak memory consumption was 29.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.57 ms. Allocated memory is still 199.2 MB. Free memory was 163.9 MB in the beginning and 160.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1064.17 ms. Allocated memory is still 199.2 MB. Free memory was 159.9 MB in the beginning and 75.9 MB in the end (delta: 84.0 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66745.45 ms. Allocated memory was 199.2 MB in the beginning and 816.8 MB in the end (delta: 617.6 MB). Free memory was 75.3 MB in the beginning and 697.9 MB in the end (delta: -622.6 MB). There was no memory consumed. 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, 66.6s OverallTime, 49 OverallIterations, 4 TraceHistogramMax, 55.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14561 SDtfs, 10315 SDslu, 44432 SDs, 0 SdLazy, 25312 SolverSat, 2739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 777 GetRequests, 224 SyntacticMatches, 14 SemanticMatches, 539 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6016 ImplicationChecksByTransitivity, 13.3s 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.4s 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.8s SatisfiabilityAnalysisTime, 3.3s 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...