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/ssh/s3_srvr.blast.06.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:53:31,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:53:31,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:53:31,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:53:31,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:53:31,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:53:31,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:53:31,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:53:31,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:53:31,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:53:31,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:53:31,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:53:31,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:53:31,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:53:31,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:53:31,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:53:31,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:53:31,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:53:31,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:53:31,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:53:31,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:53:31,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:53:31,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:53:31,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:53:31,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:53:31,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:53:31,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:53:31,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:53:31,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:53:31,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:53:31,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:53:31,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:53:31,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:53:31,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:53:31,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:53:31,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:53:31,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:53:31,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:53:31,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:53:31,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:53:31,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:53:31,676 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-09 05:53:31,691 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:53:31,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:53:31,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:53:31,692 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:53:31,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:53:31,693 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:53:31,693 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:53:31,693 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:53:31,693 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:53:31,693 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:53:31,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:53:31,694 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:53:31,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:53:31,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:53:31,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:53:31,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:53:31,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:53:31,695 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:53:31,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:53:31,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:53:31,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:53:31,696 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:53:31,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:53:31,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:53:31,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:53:31,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:53:31,697 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:53:31,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:53:31,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:53:31,698 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:53:31,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:53:31,749 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:53:31,753 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:53:31,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:53:31,755 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:53:31,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-2.c [2019-09-09 05:53:31,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69dcd1e74/02c8d1c5e12a4d25bebebe5ed7a89767/FLAGc8b2ce869 [2019-09-09 05:53:32,411 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:53:32,412 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.06.i.cil-2.c [2019-09-09 05:53:32,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69dcd1e74/02c8d1c5e12a4d25bebebe5ed7a89767/FLAGc8b2ce869 [2019-09-09 05:53:32,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69dcd1e74/02c8d1c5e12a4d25bebebe5ed7a89767 [2019-09-09 05:53:32,663 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:53:32,665 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:53:32,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:53:32,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:53:32,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:53:32,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:53:32" (1/1) ... [2019-09-09 05:53:32,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64dbbd91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:32, skipping insertion in model container [2019-09-09 05:53:32,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:53:32" (1/1) ... [2019-09-09 05:53:32,692 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:53:32,775 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:53:33,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:53:33,453 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:53:33,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:53:33,683 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:53:33,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:33 WrapperNode [2019-09-09 05:53:33,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:53:33,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:53:33,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:53:33,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:53:33,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:33" (1/1) ... [2019-09-09 05:53:33,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:33" (1/1) ... [2019-09-09 05:53:33,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:33" (1/1) ... [2019-09-09 05:53:33,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:33" (1/1) ... [2019-09-09 05:53:33,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:33" (1/1) ... [2019-09-09 05:53:33,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:33" (1/1) ... [2019-09-09 05:53:33,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:33" (1/1) ... [2019-09-09 05:53:33,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:53:33,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:53:33,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:53:33,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:53:33,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:33" (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-09 05:53:33,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:53:33,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:53:33,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-09 05:53:33,942 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-09 05:53:33,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:53:33,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:53:33,943 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-09 05:53:33,943 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-09 05:53:33,943 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-09 05:53:33,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:53:33,943 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-09 05:53:33,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:53:33,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:53:33,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:53:33,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:53:33,945 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-09 05:53:33,945 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-09 05:53:33,945 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-09 05:53:33,945 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:53:33,945 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-09 05:53:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-09 05:53:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-09 05:53:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:53:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-09 05:53:33,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-09 05:53:33,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-09 05:53:33,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-09 05:53:33,947 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-09 05:53:33,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-09 05:53:33,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:53:33,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-09 05:53:33,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-09 05:53:33,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-09 05:53:33,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:53:33,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-09 05:53:33,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-09 05:53:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-09 05:53:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-09 05:53:33,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-09 05:53:34,469 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:53:35,391 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-09 05:53:35,391 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-09 05:53:35,417 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:53:35,418 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:53:35,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:35 BoogieIcfgContainer [2019-09-09 05:53:35,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:53:35,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:53:35,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:53:35,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:53:35,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:53:32" (1/3) ... [2019-09-09 05:53:35,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ea5a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:35, skipping insertion in model container [2019-09-09 05:53:35,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:53:33" (2/3) ... [2019-09-09 05:53:35,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19ea5a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:53:35, skipping insertion in model container [2019-09-09 05:53:35,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:53:35" (3/3) ... [2019-09-09 05:53:35,428 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-2.c [2019-09-09 05:53:35,438 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:53:35,450 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:53:35,468 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:53:35,512 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:53:35,513 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:53:35,513 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:53:35,513 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:53:35,513 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:53:35,513 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:53:35,514 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:53:35,514 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:53:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-09-09 05:53:35,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-09 05:53:35,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:35,562 INFO L399 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-09 05:53:35,565 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:35,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:35,571 INFO L82 PathProgramCache]: Analyzing trace with hash -883272509, now seen corresponding path program 1 times [2019-09-09 05:53:35,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:35,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:35,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:35,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:35,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:35,955 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-09 05:53:35,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:35,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:35,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:35,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:35,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:35,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:35,990 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2019-09-09 05:53:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:36,421 INFO L93 Difference]: Finished difference Result 202 states and 334 transitions. [2019-09-09 05:53:36,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:36,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-09-09 05:53:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:36,436 INFO L225 Difference]: With dead ends: 202 [2019-09-09 05:53:36,436 INFO L226 Difference]: Without dead ends: 181 [2019-09-09 05:53:36,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-09 05:53:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2019-09-09 05:53:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-09 05:53:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 256 transitions. [2019-09-09 05:53:36,501 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 256 transitions. Word has length 51 [2019-09-09 05:53:36,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:36,501 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 256 transitions. [2019-09-09 05:53:36,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 256 transitions. [2019-09-09 05:53:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-09 05:53:36,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:36,506 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:36,506 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:36,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2034174241, now seen corresponding path program 1 times [2019-09-09 05:53:36,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:36,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:36,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:36,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:36,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:36,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:36,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:36,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:36,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:36,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:36,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:36,670 INFO L87 Difference]: Start difference. First operand 164 states and 256 transitions. Second operand 4 states. [2019-09-09 05:53:37,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:37,049 INFO L93 Difference]: Finished difference Result 181 states and 276 transitions. [2019-09-09 05:53:37,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:37,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-09 05:53:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:37,051 INFO L225 Difference]: With dead ends: 181 [2019-09-09 05:53:37,052 INFO L226 Difference]: Without dead ends: 181 [2019-09-09 05:53:37,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:37,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-09 05:53:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 164. [2019-09-09 05:53:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-09 05:53:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 255 transitions. [2019-09-09 05:53:37,064 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 255 transitions. Word has length 64 [2019-09-09 05:53:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:37,065 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 255 transitions. [2019-09-09 05:53:37,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:37,066 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 255 transitions. [2019-09-09 05:53:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:53:37,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:37,070 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:37,071 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:37,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1818184895, now seen corresponding path program 1 times [2019-09-09 05:53:37,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:37,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:37,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:37,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:37,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:37,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:37,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:37,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:37,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:37,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:37,193 INFO L87 Difference]: Start difference. First operand 164 states and 255 transitions. Second operand 4 states. [2019-09-09 05:53:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:37,491 INFO L93 Difference]: Finished difference Result 180 states and 274 transitions. [2019-09-09 05:53:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:37,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:53:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:37,493 INFO L225 Difference]: With dead ends: 180 [2019-09-09 05:53:37,494 INFO L226 Difference]: Without dead ends: 180 [2019-09-09 05:53:37,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:37,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-09 05:53:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2019-09-09 05:53:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-09 05:53:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 254 transitions. [2019-09-09 05:53:37,504 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 254 transitions. Word has length 65 [2019-09-09 05:53:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:37,505 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 254 transitions. [2019-09-09 05:53:37,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 254 transitions. [2019-09-09 05:53:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:53:37,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:37,512 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:37,513 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:37,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:37,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1638771629, now seen corresponding path program 1 times [2019-09-09 05:53:37,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:37,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:37,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:37,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:37,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:37,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:37,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:53:37,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:37,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:53:37,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:53:37,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:37,637 INFO L87 Difference]: Start difference. First operand 164 states and 254 transitions. Second operand 5 states. [2019-09-09 05:53:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:38,173 INFO L93 Difference]: Finished difference Result 185 states and 282 transitions. [2019-09-09 05:53:38,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:53:38,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-09-09 05:53:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:38,175 INFO L225 Difference]: With dead ends: 185 [2019-09-09 05:53:38,175 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:53:38,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:53:38,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:53:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-09-09 05:53:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-09 05:53:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 281 transitions. [2019-09-09 05:53:38,185 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 281 transitions. Word has length 65 [2019-09-09 05:53:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:38,185 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 281 transitions. [2019-09-09 05:53:38,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:53:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 281 transitions. [2019-09-09 05:53:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:53:38,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:38,187 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:38,188 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:38,188 INFO L82 PathProgramCache]: Analyzing trace with hash 936595467, now seen corresponding path program 1 times [2019-09-09 05:53:38,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:38,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:38,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:38,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:38,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:38,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:38,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:38,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:38,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:38,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:38,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:38,250 INFO L87 Difference]: Start difference. First operand 184 states and 281 transitions. Second operand 4 states. [2019-09-09 05:53:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:38,534 INFO L93 Difference]: Finished difference Result 199 states and 298 transitions. [2019-09-09 05:53:38,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:38,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:53:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:38,536 INFO L225 Difference]: With dead ends: 199 [2019-09-09 05:53:38,536 INFO L226 Difference]: Without dead ends: 199 [2019-09-09 05:53:38,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-09-09 05:53:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 184. [2019-09-09 05:53:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-09 05:53:38,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 280 transitions. [2019-09-09 05:53:38,545 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 280 transitions. Word has length 65 [2019-09-09 05:53:38,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:38,545 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 280 transitions. [2019-09-09 05:53:38,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 280 transitions. [2019-09-09 05:53:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-09 05:53:38,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:38,547 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:38,547 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:38,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:38,547 INFO L82 PathProgramCache]: Analyzing trace with hash 435943946, now seen corresponding path program 1 times [2019-09-09 05:53:38,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:38,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:38,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:38,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:38,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:38,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:38,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:38,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:38,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:38,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:38,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:38,644 INFO L87 Difference]: Start difference. First operand 184 states and 280 transitions. Second operand 4 states. [2019-09-09 05:53:38,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:38,897 INFO L93 Difference]: Finished difference Result 197 states and 295 transitions. [2019-09-09 05:53:38,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:38,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-09 05:53:38,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:38,899 INFO L225 Difference]: With dead ends: 197 [2019-09-09 05:53:38,900 INFO L226 Difference]: Without dead ends: 197 [2019-09-09 05:53:38,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-09 05:53:38,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-09 05:53:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-09 05:53:38,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 279 transitions. [2019-09-09 05:53:38,906 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 279 transitions. Word has length 65 [2019-09-09 05:53:38,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:38,906 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 279 transitions. [2019-09-09 05:53:38,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:38,907 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 279 transitions. [2019-09-09 05:53:38,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-09 05:53:38,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:38,908 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:38,908 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:38,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:38,909 INFO L82 PathProgramCache]: Analyzing trace with hash -601039716, now seen corresponding path program 1 times [2019-09-09 05:53:38,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:38,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:38,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:38,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:38,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:38,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:38,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:38,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:38,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:38,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:38,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:38,987 INFO L87 Difference]: Start difference. First operand 184 states and 279 transitions. Second operand 4 states. [2019-09-09 05:53:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:39,269 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2019-09-09 05:53:39,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:39,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-09 05:53:39,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:39,271 INFO L225 Difference]: With dead ends: 197 [2019-09-09 05:53:39,271 INFO L226 Difference]: Without dead ends: 197 [2019-09-09 05:53:39,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-09 05:53:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-09 05:53:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-09 05:53:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 278 transitions. [2019-09-09 05:53:39,279 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 278 transitions. Word has length 66 [2019-09-09 05:53:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:39,279 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 278 transitions. [2019-09-09 05:53:39,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 278 transitions. [2019-09-09 05:53:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-09 05:53:39,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:39,281 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:39,281 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:39,281 INFO L82 PathProgramCache]: Analyzing trace with hash -2091511225, now seen corresponding path program 1 times [2019-09-09 05:53:39,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:39,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:39,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:39,362 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:39,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:39,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:39,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:39,364 INFO L87 Difference]: Start difference. First operand 184 states and 278 transitions. Second operand 4 states. [2019-09-09 05:53:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:39,614 INFO L93 Difference]: Finished difference Result 197 states and 293 transitions. [2019-09-09 05:53:39,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:39,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-09 05:53:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:39,616 INFO L225 Difference]: With dead ends: 197 [2019-09-09 05:53:39,617 INFO L226 Difference]: Without dead ends: 197 [2019-09-09 05:53:39,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-09 05:53:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-09 05:53:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-09 05:53:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 277 transitions. [2019-09-09 05:53:39,622 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 277 transitions. Word has length 67 [2019-09-09 05:53:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:39,623 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 277 transitions. [2019-09-09 05:53:39,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:39,623 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 277 transitions. [2019-09-09 05:53:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-09 05:53:39,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:39,624 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:39,625 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:39,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2040778903, now seen corresponding path program 1 times [2019-09-09 05:53:39,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:39,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:39,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:39,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:39,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:39,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:39,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:39,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:39,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:39,702 INFO L87 Difference]: Start difference. First operand 184 states and 277 transitions. Second operand 4 states. [2019-09-09 05:53:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:39,943 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2019-09-09 05:53:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:39,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-09 05:53:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:39,946 INFO L225 Difference]: With dead ends: 197 [2019-09-09 05:53:39,946 INFO L226 Difference]: Without dead ends: 197 [2019-09-09 05:53:39,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:39,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-09-09 05:53:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 184. [2019-09-09 05:53:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-09 05:53:39,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 276 transitions. [2019-09-09 05:53:39,951 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 276 transitions. Word has length 68 [2019-09-09 05:53:39,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:39,952 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 276 transitions. [2019-09-09 05:53:39,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 276 transitions. [2019-09-09 05:53:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-09 05:53:39,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:39,953 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:39,954 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:39,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1393046730, now seen corresponding path program 1 times [2019-09-09 05:53:39,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:39,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:40,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:40,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:40,017 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:40,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:40,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:40,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:40,019 INFO L87 Difference]: Start difference. First operand 184 states and 276 transitions. Second operand 4 states. [2019-09-09 05:53:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:40,326 INFO L93 Difference]: Finished difference Result 226 states and 338 transitions. [2019-09-09 05:53:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:40,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-09 05:53:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:40,328 INFO L225 Difference]: With dead ends: 226 [2019-09-09 05:53:40,329 INFO L226 Difference]: Without dead ends: 226 [2019-09-09 05:53:40,329 INFO L628 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-09 05:53:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-09 05:53:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2019-09-09 05:53:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-09 05:53:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 313 transitions. [2019-09-09 05:53:40,337 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 313 transitions. Word has length 68 [2019-09-09 05:53:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:40,337 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 313 transitions. [2019-09-09 05:53:40,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:40,337 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 313 transitions. [2019-09-09 05:53:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-09 05:53:40,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:40,338 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:40,338 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash 90053346, now seen corresponding path program 1 times [2019-09-09 05:53:40,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:40,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:40,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:40,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:40,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:40,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:40,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:40,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:40,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:40,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:40,390 INFO L87 Difference]: Start difference. First operand 206 states and 313 transitions. Second operand 4 states. [2019-09-09 05:53:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:40,609 INFO L93 Difference]: Finished difference Result 209 states and 316 transitions. [2019-09-09 05:53:40,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:40,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-09 05:53:40,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:40,612 INFO L225 Difference]: With dead ends: 209 [2019-09-09 05:53:40,612 INFO L226 Difference]: Without dead ends: 209 [2019-09-09 05:53:40,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:40,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-09 05:53:40,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-09-09 05:53:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-09 05:53:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 312 transitions. [2019-09-09 05:53:40,619 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 312 transitions. Word has length 69 [2019-09-09 05:53:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:40,619 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 312 transitions. [2019-09-09 05:53:40,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 312 transitions. [2019-09-09 05:53:40,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:53:40,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:40,621 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:40,621 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:40,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1646996660, now seen corresponding path program 1 times [2019-09-09 05:53:40,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:40,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:40,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:40,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:40,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:40,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:40,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:40,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:40,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:40,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:40,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:40,674 INFO L87 Difference]: Start difference. First operand 206 states and 312 transitions. Second operand 4 states. [2019-09-09 05:53:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:40,958 INFO L93 Difference]: Finished difference Result 226 states and 336 transitions. [2019-09-09 05:53:40,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:40,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-09 05:53:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:40,961 INFO L225 Difference]: With dead ends: 226 [2019-09-09 05:53:40,961 INFO L226 Difference]: Without dead ends: 226 [2019-09-09 05:53:40,961 INFO L628 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-09 05:53:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-09 05:53:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2019-09-09 05:53:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-09 05:53:40,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions. [2019-09-09 05:53:40,966 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 81 [2019-09-09 05:53:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:40,967 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 311 transitions. [2019-09-09 05:53:40,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:40,967 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions. [2019-09-09 05:53:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:53:40,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:40,968 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:53:40,969 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:40,969 INFO L82 PathProgramCache]: Analyzing trace with hash 54198590, now seen corresponding path program 1 times [2019-09-09 05:53:40,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:40,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:40,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:40,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:40,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:41,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:41,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:41,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:41,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:41,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:41,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:41,030 INFO L87 Difference]: Start difference. First operand 206 states and 311 transitions. Second operand 4 states. [2019-09-09 05:53:41,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:41,295 INFO L93 Difference]: Finished difference Result 225 states and 334 transitions. [2019-09-09 05:53:41,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:41,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:53:41,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:41,298 INFO L225 Difference]: With dead ends: 225 [2019-09-09 05:53:41,298 INFO L226 Difference]: Without dead ends: 225 [2019-09-09 05:53:41,298 INFO L628 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-09 05:53:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-09-09 05:53:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2019-09-09 05:53:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-09 05:53:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 310 transitions. [2019-09-09 05:53:41,304 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 310 transitions. Word has length 82 [2019-09-09 05:53:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:41,305 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 310 transitions. [2019-09-09 05:53:41,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 310 transitions. [2019-09-09 05:53:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-09 05:53:41,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:41,306 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:53:41,306 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:41,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:41,314 INFO L82 PathProgramCache]: Analyzing trace with hash -446452931, now seen corresponding path program 1 times [2019-09-09 05:53:41,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:41,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:41,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:41,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:41,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:41,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:41,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:41,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:41,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:41,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:41,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:41,392 INFO L87 Difference]: Start difference. First operand 206 states and 310 transitions. Second operand 4 states. [2019-09-09 05:53:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:41,675 INFO L93 Difference]: Finished difference Result 223 states and 331 transitions. [2019-09-09 05:53:41,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:41,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-09 05:53:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:41,678 INFO L225 Difference]: With dead ends: 223 [2019-09-09 05:53:41,679 INFO L226 Difference]: Without dead ends: 223 [2019-09-09 05:53:41,679 INFO L628 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-09 05:53:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-09 05:53:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-09 05:53:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-09 05:53:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 309 transitions. [2019-09-09 05:53:41,687 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 309 transitions. Word has length 82 [2019-09-09 05:53:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:41,687 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 309 transitions. [2019-09-09 05:53:41,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 309 transitions. [2019-09-09 05:53:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-09 05:53:41,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:41,689 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-09 05:53:41,689 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:41,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2109428169, now seen corresponding path program 1 times [2019-09-09 05:53:41,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:41,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:41,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:41,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:41,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:41,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:41,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:41,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:41,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:41,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:41,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:41,760 INFO L87 Difference]: Start difference. First operand 206 states and 309 transitions. Second operand 4 states. [2019-09-09 05:53:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:42,014 INFO L93 Difference]: Finished difference Result 223 states and 330 transitions. [2019-09-09 05:53:42,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:42,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-09 05:53:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:42,015 INFO L225 Difference]: With dead ends: 223 [2019-09-09 05:53:42,016 INFO L226 Difference]: Without dead ends: 223 [2019-09-09 05:53:42,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-09 05:53:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-09 05:53:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-09 05:53:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 308 transitions. [2019-09-09 05:53:42,022 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 308 transitions. Word has length 83 [2019-09-09 05:53:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:42,022 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 308 transitions. [2019-09-09 05:53:42,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:42,023 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 308 transitions. [2019-09-09 05:53:42,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-09 05:53:42,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:42,024 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-09 05:53:42,024 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:42,025 INFO L82 PathProgramCache]: Analyzing trace with hash 328614586, now seen corresponding path program 1 times [2019-09-09 05:53:42,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:42,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:42,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:42,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:42,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:42,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:42,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:42,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:42,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:42,083 INFO L87 Difference]: Start difference. First operand 206 states and 308 transitions. Second operand 4 states. [2019-09-09 05:53:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:42,355 INFO L93 Difference]: Finished difference Result 223 states and 329 transitions. [2019-09-09 05:53:42,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:42,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-09 05:53:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:42,357 INFO L225 Difference]: With dead ends: 223 [2019-09-09 05:53:42,358 INFO L226 Difference]: Without dead ends: 223 [2019-09-09 05:53:42,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-09 05:53:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-09 05:53:42,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-09 05:53:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 307 transitions. [2019-09-09 05:53:42,364 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 307 transitions. Word has length 84 [2019-09-09 05:53:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:42,364 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 307 transitions. [2019-09-09 05:53:42,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 307 transitions. [2019-09-09 05:53:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-09 05:53:42,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:42,366 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-09 05:53:42,366 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:42,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:42,366 INFO L82 PathProgramCache]: Analyzing trace with hash -244732284, now seen corresponding path program 1 times [2019-09-09 05:53:42,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:42,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:42,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:42,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:42,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:42,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:42,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:42,417 INFO L87 Difference]: Start difference. First operand 206 states and 307 transitions. Second operand 4 states. [2019-09-09 05:53:42,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:42,746 INFO L93 Difference]: Finished difference Result 223 states and 328 transitions. [2019-09-09 05:53:42,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:42,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-09 05:53:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:42,749 INFO L225 Difference]: With dead ends: 223 [2019-09-09 05:53:42,749 INFO L226 Difference]: Without dead ends: 223 [2019-09-09 05:53:42,750 INFO L628 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-09 05:53:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-09 05:53:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 206. [2019-09-09 05:53:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-09 05:53:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 306 transitions. [2019-09-09 05:53:42,758 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 306 transitions. Word has length 85 [2019-09-09 05:53:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:42,759 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 306 transitions. [2019-09-09 05:53:42,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 306 transitions. [2019-09-09 05:53:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-09 05:53:42,761 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:42,761 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:42,762 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:42,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:42,762 INFO L82 PathProgramCache]: Analyzing trace with hash -2041316715, now seen corresponding path program 1 times [2019-09-09 05:53:42,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:42,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:42,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:42,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:53:42,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:42,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:42,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:42,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:42,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:42,915 INFO L87 Difference]: Start difference. First operand 206 states and 306 transitions. Second operand 4 states. [2019-09-09 05:53:43,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:43,183 INFO L93 Difference]: Finished difference Result 213 states and 315 transitions. [2019-09-09 05:53:43,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:43,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-09-09 05:53:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:43,185 INFO L225 Difference]: With dead ends: 213 [2019-09-09 05:53:43,185 INFO L226 Difference]: Without dead ends: 213 [2019-09-09 05:53:43,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-09 05:53:43,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 206. [2019-09-09 05:53:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-09 05:53:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 305 transitions. [2019-09-09 05:53:43,191 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 305 transitions. Word has length 86 [2019-09-09 05:53:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:43,192 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 305 transitions. [2019-09-09 05:53:43,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 305 transitions. [2019-09-09 05:53:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:53:43,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:43,193 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:43,194 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:43,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:43,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1423979757, now seen corresponding path program 1 times [2019-09-09 05:53:43,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:43,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:43,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:43,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:43,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:43,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:43,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:43,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:43,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:43,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:43,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:43,311 INFO L87 Difference]: Start difference. First operand 206 states and 305 transitions. Second operand 4 states. [2019-09-09 05:53:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:43,701 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-09-09 05:53:43,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:43,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-09 05:53:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:43,705 INFO L225 Difference]: With dead ends: 321 [2019-09-09 05:53:43,705 INFO L226 Difference]: Without dead ends: 321 [2019-09-09 05:53:43,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-09 05:53:43,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 247. [2019-09-09 05:53:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-09 05:53:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 378 transitions. [2019-09-09 05:53:43,712 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 378 transitions. Word has length 90 [2019-09-09 05:53:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:43,712 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 378 transitions. [2019-09-09 05:53:43,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 378 transitions. [2019-09-09 05:53:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:53:43,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:43,713 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:43,714 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:43,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:43,714 INFO L82 PathProgramCache]: Analyzing trace with hash 526586479, now seen corresponding path program 1 times [2019-09-09 05:53:43,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:43,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:43,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:43,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:43,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:43,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:43,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:43,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:43,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:43,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:43,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:43,783 INFO L87 Difference]: Start difference. First operand 247 states and 378 transitions. Second operand 4 states. [2019-09-09 05:53:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:44,113 INFO L93 Difference]: Finished difference Result 296 states and 451 transitions. [2019-09-09 05:53:44,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:44,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-09 05:53:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:44,116 INFO L225 Difference]: With dead ends: 296 [2019-09-09 05:53:44,116 INFO L226 Difference]: Without dead ends: 296 [2019-09-09 05:53:44,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-09 05:53:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2019-09-09 05:53:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-09 05:53:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 419 transitions. [2019-09-09 05:53:44,123 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 419 transitions. Word has length 90 [2019-09-09 05:53:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:44,123 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 419 transitions. [2019-09-09 05:53:44,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 419 transitions. [2019-09-09 05:53:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-09 05:53:44,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:44,125 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:44,125 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:44,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:44,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1255891959, now seen corresponding path program 1 times [2019-09-09 05:53:44,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:44,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:44,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:44,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:44,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:44,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:44,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:44,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:44,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:44,220 INFO L87 Difference]: Start difference. First operand 271 states and 419 transitions. Second operand 4 states. [2019-09-09 05:53:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:44,636 INFO L93 Difference]: Finished difference Result 335 states and 509 transitions. [2019-09-09 05:53:44,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:44,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-09 05:53:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:44,638 INFO L225 Difference]: With dead ends: 335 [2019-09-09 05:53:44,639 INFO L226 Difference]: Without dead ends: 335 [2019-09-09 05:53:44,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-09 05:53:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 272. [2019-09-09 05:53:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 420 transitions. [2019-09-09 05:53:44,646 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 420 transitions. Word has length 91 [2019-09-09 05:53:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:44,646 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 420 transitions. [2019-09-09 05:53:44,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 420 transitions. [2019-09-09 05:53:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:53:44,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:44,648 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-09-09 05:53:44,648 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2083138293, now seen corresponding path program 1 times [2019-09-09 05:53:44,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:44,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:44,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:44,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:44,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:44,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:44,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:44,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:44,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:44,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:44,710 INFO L87 Difference]: Start difference. First operand 272 states and 420 transitions. Second operand 4 states. [2019-09-09 05:53:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:45,071 INFO L93 Difference]: Finished difference Result 335 states and 508 transitions. [2019-09-09 05:53:45,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:45,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:53:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:45,076 INFO L225 Difference]: With dead ends: 335 [2019-09-09 05:53:45,076 INFO L226 Difference]: Without dead ends: 335 [2019-09-09 05:53:45,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-09-09 05:53:45,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 272. [2019-09-09 05:53:45,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 419 transitions. [2019-09-09 05:53:45,089 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 419 transitions. Word has length 103 [2019-09-09 05:53:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:45,090 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 419 transitions. [2019-09-09 05:53:45,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 419 transitions. [2019-09-09 05:53:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:53:45,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:45,091 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-09-09 05:53:45,092 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:45,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2123813043, now seen corresponding path program 1 times [2019-09-09 05:53:45,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:45,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:45,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:45,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:45,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:45,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:45,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:45,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:45,174 INFO L87 Difference]: Start difference. First operand 272 states and 419 transitions. Second operand 4 states. [2019-09-09 05:53:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:45,554 INFO L93 Difference]: Finished difference Result 297 states and 450 transitions. [2019-09-09 05:53:45,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:45,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-09 05:53:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:45,557 INFO L225 Difference]: With dead ends: 297 [2019-09-09 05:53:45,557 INFO L226 Difference]: Without dead ends: 297 [2019-09-09 05:53:45,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:45,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-09 05:53:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 272. [2019-09-09 05:53:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 418 transitions. [2019-09-09 05:53:45,564 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 418 transitions. Word has length 103 [2019-09-09 05:53:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:45,565 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 418 transitions. [2019-09-09 05:53:45,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 418 transitions. [2019-09-09 05:53:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:53:45,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:45,566 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:53:45,566 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:45,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:45,567 INFO L82 PathProgramCache]: Analyzing trace with hash -275734859, now seen corresponding path program 1 times [2019-09-09 05:53:45,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:45,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:45,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:45,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:45,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:45,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:45,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:45,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:45,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:45,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:45,659 INFO L87 Difference]: Start difference. First operand 272 states and 418 transitions. Second operand 4 states. [2019-09-09 05:53:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:46,124 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-09-09 05:53:46,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:46,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:53:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:46,128 INFO L225 Difference]: With dead ends: 334 [2019-09-09 05:53:46,129 INFO L226 Difference]: Without dead ends: 334 [2019-09-09 05:53:46,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:46,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-09 05:53:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 272. [2019-09-09 05:53:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 417 transitions. [2019-09-09 05:53:46,136 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 417 transitions. Word has length 104 [2019-09-09 05:53:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:46,137 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 417 transitions. [2019-09-09 05:53:46,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 417 transitions. [2019-09-09 05:53:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:53:46,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:46,138 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:46,138 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:46,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:46,140 INFO L82 PathProgramCache]: Analyzing trace with hash -776386380, now seen corresponding path program 1 times [2019-09-09 05:53:46,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:46,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:46,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:46,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:46,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:46,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:46,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:46,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:46,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:46,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:46,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:46,209 INFO L87 Difference]: Start difference. First operand 272 states and 417 transitions. Second operand 4 states. [2019-09-09 05:53:46,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:46,613 INFO L93 Difference]: Finished difference Result 332 states and 502 transitions. [2019-09-09 05:53:46,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:46,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:53:46,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:46,616 INFO L225 Difference]: With dead ends: 332 [2019-09-09 05:53:46,616 INFO L226 Difference]: Without dead ends: 332 [2019-09-09 05:53:46,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-09 05:53:46,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-09 05:53:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 416 transitions. [2019-09-09 05:53:46,624 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 416 transitions. Word has length 104 [2019-09-09 05:53:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:46,624 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 416 transitions. [2019-09-09 05:53:46,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 416 transitions. [2019-09-09 05:53:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:53:46,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:46,626 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:53:46,626 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:46,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash 985182391, now seen corresponding path program 1 times [2019-09-09 05:53:46,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:46,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:46,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:46,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:46,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:46,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:46,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:46,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:46,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:46,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:46,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:46,692 INFO L87 Difference]: Start difference. First operand 272 states and 416 transitions. Second operand 4 states. [2019-09-09 05:53:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:46,996 INFO L93 Difference]: Finished difference Result 296 states and 446 transitions. [2019-09-09 05:53:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:46,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:53:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:46,998 INFO L225 Difference]: With dead ends: 296 [2019-09-09 05:53:46,998 INFO L226 Difference]: Without dead ends: 296 [2019-09-09 05:53:46,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-09 05:53:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 272. [2019-09-09 05:53:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 415 transitions. [2019-09-09 05:53:47,006 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 415 transitions. Word has length 104 [2019-09-09 05:53:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:47,006 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 415 transitions. [2019-09-09 05:53:47,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 415 transitions. [2019-09-09 05:53:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:53:47,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:47,008 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-09 05:53:47,008 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:47,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:47,008 INFO L82 PathProgramCache]: Analyzing trace with hash 484530870, now seen corresponding path program 1 times [2019-09-09 05:53:47,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:47,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:47,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:47,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:47,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:47,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:47,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:47,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:47,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:47,074 INFO L87 Difference]: Start difference. First operand 272 states and 415 transitions. Second operand 4 states. [2019-09-09 05:53:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:47,383 INFO L93 Difference]: Finished difference Result 294 states and 443 transitions. [2019-09-09 05:53:47,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:47,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-09 05:53:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:47,386 INFO L225 Difference]: With dead ends: 294 [2019-09-09 05:53:47,386 INFO L226 Difference]: Without dead ends: 294 [2019-09-09 05:53:47,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-09 05:53:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-09 05:53:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 414 transitions. [2019-09-09 05:53:47,393 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 414 transitions. Word has length 104 [2019-09-09 05:53:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:47,394 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 414 transitions. [2019-09-09 05:53:47,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 414 transitions. [2019-09-09 05:53:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:53:47,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:47,395 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-09 05:53:47,395 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:47,396 INFO L82 PathProgramCache]: Analyzing trace with hash 471425842, now seen corresponding path program 1 times [2019-09-09 05:53:47,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:47,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:47,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:47,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:47,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:47,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:47,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:47,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:47,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:47,481 INFO L87 Difference]: Start difference. First operand 272 states and 414 transitions. Second operand 4 states. [2019-09-09 05:53:47,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:47,908 INFO L93 Difference]: Finished difference Result 332 states and 499 transitions. [2019-09-09 05:53:47,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:47,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:53:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:47,911 INFO L225 Difference]: With dead ends: 332 [2019-09-09 05:53:47,911 INFO L226 Difference]: Without dead ends: 332 [2019-09-09 05:53:47,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-09 05:53:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-09 05:53:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 413 transitions. [2019-09-09 05:53:47,919 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 413 transitions. Word has length 105 [2019-09-09 05:53:47,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:47,919 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 413 transitions. [2019-09-09 05:53:47,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 413 transitions. [2019-09-09 05:53:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:53:47,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:47,921 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-09 05:53:47,921 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash 905154928, now seen corresponding path program 1 times [2019-09-09 05:53:47,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:47,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:47,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:47,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:47,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:47,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:47,975 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:47,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:47,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:47,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:47,976 INFO L87 Difference]: Start difference. First operand 272 states and 413 transitions. Second operand 4 states. [2019-09-09 05:53:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:48,292 INFO L93 Difference]: Finished difference Result 294 states and 441 transitions. [2019-09-09 05:53:48,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:48,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-09 05:53:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:48,295 INFO L225 Difference]: With dead ends: 294 [2019-09-09 05:53:48,298 INFO L226 Difference]: Without dead ends: 294 [2019-09-09 05:53:48,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-09 05:53:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-09 05:53:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 412 transitions. [2019-09-09 05:53:48,307 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 412 transitions. Word has length 105 [2019-09-09 05:53:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:48,307 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 412 transitions. [2019-09-09 05:53:48,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 412 transitions. [2019-09-09 05:53:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:53:48,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:48,309 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:53:48,309 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:48,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:48,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1090150001, now seen corresponding path program 1 times [2019-09-09 05:53:48,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:48,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:48,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:48,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:48,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:48,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:48,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:48,392 INFO L87 Difference]: Start difference. First operand 272 states and 412 transitions. Second operand 4 states. [2019-09-09 05:53:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:48,789 INFO L93 Difference]: Finished difference Result 332 states and 497 transitions. [2019-09-09 05:53:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:48,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:53:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:48,792 INFO L225 Difference]: With dead ends: 332 [2019-09-09 05:53:48,792 INFO L226 Difference]: Without dead ends: 332 [2019-09-09 05:53:48,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-09 05:53:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-09 05:53:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 411 transitions. [2019-09-09 05:53:48,800 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 411 transitions. Word has length 106 [2019-09-09 05:53:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:48,800 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 411 transitions. [2019-09-09 05:53:48,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 411 transitions. [2019-09-09 05:53:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:53:48,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:48,802 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:53:48,802 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:48,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1650849779, now seen corresponding path program 1 times [2019-09-09 05:53:48,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:48,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:48,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:48,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:48,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:48,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:48,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:48,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:48,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:48,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:48,867 INFO L87 Difference]: Start difference. First operand 272 states and 411 transitions. Second operand 4 states. [2019-09-09 05:53:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:49,167 INFO L93 Difference]: Finished difference Result 294 states and 439 transitions. [2019-09-09 05:53:49,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:49,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-09 05:53:49,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:49,173 INFO L225 Difference]: With dead ends: 294 [2019-09-09 05:53:49,173 INFO L226 Difference]: Without dead ends: 294 [2019-09-09 05:53:49,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-09 05:53:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-09 05:53:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 410 transitions. [2019-09-09 05:53:49,180 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 410 transitions. Word has length 106 [2019-09-09 05:53:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:49,180 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 410 transitions. [2019-09-09 05:53:49,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 410 transitions. [2019-09-09 05:53:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-09 05:53:49,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:49,182 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:53:49,182 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:49,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1888029101, now seen corresponding path program 1 times [2019-09-09 05:53:49,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:49,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:49,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:49,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:49,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:49,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:49,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:49,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:49,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:49,259 INFO L87 Difference]: Start difference. First operand 272 states and 410 transitions. Second operand 4 states. [2019-09-09 05:53:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:49,691 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2019-09-09 05:53:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:49,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-09 05:53:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:49,693 INFO L225 Difference]: With dead ends: 332 [2019-09-09 05:53:49,693 INFO L226 Difference]: Without dead ends: 332 [2019-09-09 05:53:49,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:49,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-09 05:53:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 272. [2019-09-09 05:53:49,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 409 transitions. [2019-09-09 05:53:49,700 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 409 transitions. Word has length 107 [2019-09-09 05:53:49,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:49,700 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 409 transitions. [2019-09-09 05:53:49,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 409 transitions. [2019-09-09 05:53:49,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-09 05:53:49,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:49,702 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-09-09 05:53:49,702 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:49,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:49,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2089853035, now seen corresponding path program 1 times [2019-09-09 05:53:49,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:49,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:49,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:49,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:49,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:49,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:49,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:49,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:49,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:49,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:49,773 INFO L87 Difference]: Start difference. First operand 272 states and 409 transitions. Second operand 4 states. [2019-09-09 05:53:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:50,081 INFO L93 Difference]: Finished difference Result 294 states and 437 transitions. [2019-09-09 05:53:50,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:50,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-09 05:53:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:50,083 INFO L225 Difference]: With dead ends: 294 [2019-09-09 05:53:50,083 INFO L226 Difference]: Without dead ends: 294 [2019-09-09 05:53:50,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-09 05:53:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 272. [2019-09-09 05:53:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 408 transitions. [2019-09-09 05:53:50,090 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 408 transitions. Word has length 107 [2019-09-09 05:53:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:50,090 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 408 transitions. [2019-09-09 05:53:50,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 408 transitions. [2019-09-09 05:53:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-09 05:53:50,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:50,092 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:50,092 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:50,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:50,093 INFO L82 PathProgramCache]: Analyzing trace with hash -350223220, now seen corresponding path program 1 times [2019-09-09 05:53:50,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:50,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:50,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:50,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:50,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:50,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:50,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:50,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:50,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:50,165 INFO L87 Difference]: Start difference. First operand 272 states and 408 transitions. Second operand 4 states. [2019-09-09 05:53:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:50,575 INFO L93 Difference]: Finished difference Result 322 states and 481 transitions. [2019-09-09 05:53:50,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:50,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-09 05:53:50,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:50,578 INFO L225 Difference]: With dead ends: 322 [2019-09-09 05:53:50,578 INFO L226 Difference]: Without dead ends: 322 [2019-09-09 05:53:50,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:50,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-09 05:53:50,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 272. [2019-09-09 05:53:50,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 407 transitions. [2019-09-09 05:53:50,584 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 407 transitions. Word has length 108 [2019-09-09 05:53:50,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:50,584 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 407 transitions. [2019-09-09 05:53:50,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 407 transitions. [2019-09-09 05:53:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-09 05:53:50,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:50,586 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:50,586 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:50,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:50,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1611351438, now seen corresponding path program 1 times [2019-09-09 05:53:50,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:50,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:50,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:50,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:50,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:50,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:50,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:50,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:50,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:50,650 INFO L87 Difference]: Start difference. First operand 272 states and 407 transitions. Second operand 4 states. [2019-09-09 05:53:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:50,910 INFO L93 Difference]: Finished difference Result 284 states and 423 transitions. [2019-09-09 05:53:50,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:50,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-09-09 05:53:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:50,913 INFO L225 Difference]: With dead ends: 284 [2019-09-09 05:53:50,913 INFO L226 Difference]: Without dead ends: 284 [2019-09-09 05:53:50,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-09 05:53:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 272. [2019-09-09 05:53:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 406 transitions. [2019-09-09 05:53:50,920 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 406 transitions. Word has length 108 [2019-09-09 05:53:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:50,920 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 406 transitions. [2019-09-09 05:53:50,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 406 transitions. [2019-09-09 05:53:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 05:53:50,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:50,922 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:50,922 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:50,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1622638414, now seen corresponding path program 1 times [2019-09-09 05:53:50,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:50,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:50,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:50,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:53:50,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:50,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:50,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:50,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:50,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:50,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:50,994 INFO L87 Difference]: Start difference. First operand 272 states and 406 transitions. Second operand 4 states. [2019-09-09 05:53:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:51,419 INFO L93 Difference]: Finished difference Result 322 states and 479 transitions. [2019-09-09 05:53:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:51,420 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-09 05:53:51,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:51,421 INFO L225 Difference]: With dead ends: 322 [2019-09-09 05:53:51,421 INFO L226 Difference]: Without dead ends: 322 [2019-09-09 05:53:51,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:53:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-09 05:53:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 272. [2019-09-09 05:53:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-09-09 05:53:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 405 transitions. [2019-09-09 05:53:51,427 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 405 transitions. Word has length 112 [2019-09-09 05:53:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:51,427 INFO L475 AbstractCegarLoop]: Abstraction has 272 states and 405 transitions. [2019-09-09 05:53:51,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 405 transitions. [2019-09-09 05:53:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 05:53:51,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:51,430 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:51,430 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:51,430 INFO L82 PathProgramCache]: Analyzing trace with hash 986149044, now seen corresponding path program 1 times [2019-09-09 05:53:51,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:51,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-09 05:53:51,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:51,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:51,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:51,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:51,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:51,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:51,546 INFO L87 Difference]: Start difference. First operand 272 states and 405 transitions. Second operand 3 states. [2019-09-09 05:53:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:51,649 INFO L93 Difference]: Finished difference Result 517 states and 762 transitions. [2019-09-09 05:53:51,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:51,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-09 05:53:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:51,652 INFO L225 Difference]: With dead ends: 517 [2019-09-09 05:53:51,652 INFO L226 Difference]: Without dead ends: 517 [2019-09-09 05:53:51,653 INFO L628 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-09 05:53:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-09 05:53:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2019-09-09 05:53:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-09-09 05:53:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 762 transitions. [2019-09-09 05:53:51,666 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 762 transitions. Word has length 112 [2019-09-09 05:53:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:51,668 INFO L475 AbstractCegarLoop]: Abstraction has 517 states and 762 transitions. [2019-09-09 05:53:51,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 762 transitions. [2019-09-09 05:53:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-09 05:53:51,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:51,670 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:53:51,671 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:51,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:51,671 INFO L82 PathProgramCache]: Analyzing trace with hash 710276126, now seen corresponding path program 1 times [2019-09-09 05:53:51,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:51,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:51,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-09 05:53:51,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:51,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:51,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:51,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:51,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:51,756 INFO L87 Difference]: Start difference. First operand 517 states and 762 transitions. Second operand 3 states. [2019-09-09 05:53:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:51,883 INFO L93 Difference]: Finished difference Result 762 states and 1120 transitions. [2019-09-09 05:53:51,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:51,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-09-09 05:53:51,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:51,887 INFO L225 Difference]: With dead ends: 762 [2019-09-09 05:53:51,887 INFO L226 Difference]: Without dead ends: 762 [2019-09-09 05:53:51,888 INFO L628 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-09 05:53:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-09-09 05:53:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2019-09-09 05:53:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-09-09 05:53:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1120 transitions. [2019-09-09 05:53:51,905 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1120 transitions. Word has length 114 [2019-09-09 05:53:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:51,906 INFO L475 AbstractCegarLoop]: Abstraction has 762 states and 1120 transitions. [2019-09-09 05:53:51,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1120 transitions. [2019-09-09 05:53:51,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:53:51,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:51,910 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:51,910 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:51,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:51,911 INFO L82 PathProgramCache]: Analyzing trace with hash 970034653, now seen corresponding path program 1 times [2019-09-09 05:53:51,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:51,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:51,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:51,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:52,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:52,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:52,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:52,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:52,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:52,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:52,019 INFO L87 Difference]: Start difference. First operand 762 states and 1120 transitions. Second operand 4 states. [2019-09-09 05:53:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:52,434 INFO L93 Difference]: Finished difference Result 951 states and 1411 transitions. [2019-09-09 05:53:52,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:52,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-09 05:53:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:52,439 INFO L225 Difference]: With dead ends: 951 [2019-09-09 05:53:52,440 INFO L226 Difference]: Without dead ends: 951 [2019-09-09 05:53:52,440 INFO L628 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-09 05:53:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-09 05:53:52,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 846. [2019-09-09 05:53:52,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-09 05:53:52,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1267 transitions. [2019-09-09 05:53:52,455 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1267 transitions. Word has length 143 [2019-09-09 05:53:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:52,455 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1267 transitions. [2019-09-09 05:53:52,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:52,455 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1267 transitions. [2019-09-09 05:53:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-09 05:53:52,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:52,458 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:52,459 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:52,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:52,459 INFO L82 PathProgramCache]: Analyzing trace with hash -468396027, now seen corresponding path program 1 times [2019-09-09 05:53:52,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:52,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:52,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:52,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:52,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:52,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:52,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:52,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:52,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:52,539 INFO L87 Difference]: Start difference. First operand 846 states and 1267 transitions. Second operand 4 states. [2019-09-09 05:53:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:52,897 INFO L93 Difference]: Finished difference Result 951 states and 1408 transitions. [2019-09-09 05:53:52,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:52,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-09 05:53:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:52,902 INFO L225 Difference]: With dead ends: 951 [2019-09-09 05:53:52,902 INFO L226 Difference]: Without dead ends: 951 [2019-09-09 05:53:52,902 INFO L628 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-09 05:53:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-09-09 05:53:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 846. [2019-09-09 05:53:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-09 05:53:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1264 transitions. [2019-09-09 05:53:52,915 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1264 transitions. Word has length 156 [2019-09-09 05:53:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:52,916 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1264 transitions. [2019-09-09 05:53:52,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1264 transitions. [2019-09-09 05:53:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:53:52,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:52,920 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:52,920 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2063887451, now seen corresponding path program 1 times [2019-09-09 05:53:52,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:52,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:53,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:53,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:53,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:53,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:53,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:53,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:53,058 INFO L87 Difference]: Start difference. First operand 846 states and 1264 transitions. Second operand 4 states. [2019-09-09 05:53:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:53,429 INFO L93 Difference]: Finished difference Result 948 states and 1402 transitions. [2019-09-09 05:53:53,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:53,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:53:53,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:53,435 INFO L225 Difference]: With dead ends: 948 [2019-09-09 05:53:53,435 INFO L226 Difference]: Without dead ends: 948 [2019-09-09 05:53:53,436 INFO L628 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-09 05:53:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-09-09 05:53:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 846. [2019-09-09 05:53:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-09 05:53:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1261 transitions. [2019-09-09 05:53:53,450 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1261 transitions. Word has length 157 [2019-09-09 05:53:53,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:53,451 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1261 transitions. [2019-09-09 05:53:53,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:53,451 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1261 transitions. [2019-09-09 05:53:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:53:53,453 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:53,453 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:53,454 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:53,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:53,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1730428324, now seen corresponding path program 1 times [2019-09-09 05:53:53,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:53,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:53,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:53,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:53,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:53,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:53,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:53,555 INFO L87 Difference]: Start difference. First operand 846 states and 1261 transitions. Second operand 4 states. [2019-09-09 05:53:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:53,951 INFO L93 Difference]: Finished difference Result 942 states and 1393 transitions. [2019-09-09 05:53:53,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:53,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-09 05:53:53,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:53,956 INFO L225 Difference]: With dead ends: 942 [2019-09-09 05:53:53,957 INFO L226 Difference]: Without dead ends: 942 [2019-09-09 05:53:53,957 INFO L628 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-09 05:53:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-09 05:53:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-09 05:53:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-09 05:53:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1258 transitions. [2019-09-09 05:53:53,973 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1258 transitions. Word has length 157 [2019-09-09 05:53:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:53,973 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1258 transitions. [2019-09-09 05:53:53,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1258 transitions. [2019-09-09 05:53:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:53:53,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:53,976 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:53,976 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:53,977 INFO L82 PathProgramCache]: Analyzing trace with hash 873270338, now seen corresponding path program 1 times [2019-09-09 05:53:53,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:53,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:53,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:53,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:54,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:54,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:54,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:54,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:54,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:54,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,071 INFO L87 Difference]: Start difference. First operand 846 states and 1258 transitions. Second operand 4 states. [2019-09-09 05:53:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:54,443 INFO L93 Difference]: Finished difference Result 942 states and 1390 transitions. [2019-09-09 05:53:54,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:54,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-09 05:53:54,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:54,448 INFO L225 Difference]: With dead ends: 942 [2019-09-09 05:53:54,448 INFO L226 Difference]: Without dead ends: 942 [2019-09-09 05:53:54,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-09 05:53:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-09 05:53:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-09 05:53:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1255 transitions. [2019-09-09 05:53:54,466 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1255 transitions. Word has length 158 [2019-09-09 05:53:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:54,467 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1255 transitions. [2019-09-09 05:53:54,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1255 transitions. [2019-09-09 05:53:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-09 05:53:54,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:54,470 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:54,470 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:54,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash 662427489, now seen corresponding path program 1 times [2019-09-09 05:53:54,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:54,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:54,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:54,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:54,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:54,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:54,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:54,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:54,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,596 INFO L87 Difference]: Start difference. First operand 846 states and 1255 transitions. Second operand 4 states. [2019-09-09 05:53:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:54,938 INFO L93 Difference]: Finished difference Result 942 states and 1387 transitions. [2019-09-09 05:53:54,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:54,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-09 05:53:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:54,943 INFO L225 Difference]: With dead ends: 942 [2019-09-09 05:53:54,943 INFO L226 Difference]: Without dead ends: 942 [2019-09-09 05:53:54,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:54,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-09 05:53:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-09 05:53:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-09 05:53:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1252 transitions. [2019-09-09 05:53:54,957 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1252 transitions. Word has length 159 [2019-09-09 05:53:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:54,957 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1252 transitions. [2019-09-09 05:53:54,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1252 transitions. [2019-09-09 05:53:54,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:53:54,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:54,960 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:54,960 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1513533117, now seen corresponding path program 1 times [2019-09-09 05:53:54,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:54,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:54,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:54,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:55,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:55,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:55,054 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:55,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:55,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:55,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:55,055 INFO L87 Difference]: Start difference. First operand 846 states and 1252 transitions. Second operand 4 states. [2019-09-09 05:53:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:55,387 INFO L93 Difference]: Finished difference Result 942 states and 1384 transitions. [2019-09-09 05:53:55,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:55,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-09 05:53:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:55,392 INFO L225 Difference]: With dead ends: 942 [2019-09-09 05:53:55,392 INFO L226 Difference]: Without dead ends: 942 [2019-09-09 05:53:55,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-09-09 05:53:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 846. [2019-09-09 05:53:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-09 05:53:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1249 transitions. [2019-09-09 05:53:55,402 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1249 transitions. Word has length 160 [2019-09-09 05:53:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,402 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1249 transitions. [2019-09-09 05:53:55,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1249 transitions. [2019-09-09 05:53:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:53:55,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,405 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:55,405 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash 925303164, now seen corresponding path program 1 times [2019-09-09 05:53:55,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:55,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:55,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:55,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:55,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:55,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:55,497 INFO L87 Difference]: Start difference. First operand 846 states and 1249 transitions. Second operand 4 states. [2019-09-09 05:53:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:55,890 INFO L93 Difference]: Finished difference Result 912 states and 1345 transitions. [2019-09-09 05:53:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:55,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-09 05:53:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:55,895 INFO L225 Difference]: With dead ends: 912 [2019-09-09 05:53:55,895 INFO L226 Difference]: Without dead ends: 912 [2019-09-09 05:53:55,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-09 05:53:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 846. [2019-09-09 05:53:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-09 05:53:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1246 transitions. [2019-09-09 05:53:55,908 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1246 transitions. Word has length 161 [2019-09-09 05:53:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:55,909 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1246 transitions. [2019-09-09 05:53:55,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1246 transitions. [2019-09-09 05:53:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-09 05:53:55,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:55,911 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-09 05:53:55,912 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:55,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1688700322, now seen corresponding path program 1 times [2019-09-09 05:53:55,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:55,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:55,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:55,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:56,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:56,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:56,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:56,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:56,001 INFO L87 Difference]: Start difference. First operand 846 states and 1246 transitions. Second operand 4 states. [2019-09-09 05:53:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:56,343 INFO L93 Difference]: Finished difference Result 912 states and 1342 transitions. [2019-09-09 05:53:56,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:56,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-09 05:53:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:56,347 INFO L225 Difference]: With dead ends: 912 [2019-09-09 05:53:56,347 INFO L226 Difference]: Without dead ends: 912 [2019-09-09 05:53:56,347 INFO L628 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-09 05:53:56,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-09-09 05:53:56,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 846. [2019-09-09 05:53:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-09 05:53:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1243 transitions. [2019-09-09 05:53:56,357 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1243 transitions. Word has length 165 [2019-09-09 05:53:56,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:56,357 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1243 transitions. [2019-09-09 05:53:56,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1243 transitions. [2019-09-09 05:53:56,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-09 05:53:56,359 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:56,359 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-09 05:53:56,359 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:56,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1820633757, now seen corresponding path program 1 times [2019-09-09 05:53:56,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:56,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-09 05:53:56,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:53:56,494 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:53:56,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:53:56,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:53:56,495 INFO L87 Difference]: Start difference. First operand 846 states and 1243 transitions. Second operand 4 states. [2019-09-09 05:53:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:56,834 INFO L93 Difference]: Finished difference Result 897 states and 1318 transitions. [2019-09-09 05:53:56,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:53:56,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-09-09 05:53:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:56,839 INFO L225 Difference]: With dead ends: 897 [2019-09-09 05:53:56,839 INFO L226 Difference]: Without dead ends: 897 [2019-09-09 05:53:56,840 INFO L628 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-09 05:53:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-09 05:53:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 846. [2019-09-09 05:53:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-09 05:53:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1240 transitions. [2019-09-09 05:53:56,852 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1240 transitions. Word has length 166 [2019-09-09 05:53:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:56,852 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1240 transitions. [2019-09-09 05:53:56,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:53:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1240 transitions. [2019-09-09 05:53:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-09 05:53:56,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:56,855 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-09-09 05:53:56,855 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1793770082, now seen corresponding path program 1 times [2019-09-09 05:53:56,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:56,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:56,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:56,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-09 05:53:56,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:56,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:56,950 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:56,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:56,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:56,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:56,951 INFO L87 Difference]: Start difference. First operand 846 states and 1240 transitions. Second operand 3 states. [2019-09-09 05:53:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,042 INFO L93 Difference]: Finished difference Result 1119 states and 1639 transitions. [2019-09-09 05:53:57,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:57,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-09 05:53:57,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:57,047 INFO L225 Difference]: With dead ends: 1119 [2019-09-09 05:53:57,048 INFO L226 Difference]: Without dead ends: 1119 [2019-09-09 05:53:57,048 INFO L628 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-09 05:53:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-09-09 05:53:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2019-09-09 05:53:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-09-09 05:53:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1639 transitions. [2019-09-09 05:53:57,064 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1639 transitions. Word has length 168 [2019-09-09 05:53:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:57,064 INFO L475 AbstractCegarLoop]: Abstraction has 1119 states and 1639 transitions. [2019-09-09 05:53:57,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1639 transitions. [2019-09-09 05:53:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-09 05:53:57,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:57,068 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-09-09 05:53:57,068 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:57,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:57,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1907591715, now seen corresponding path program 1 times [2019-09-09 05:53:57,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:57,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:57,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-09 05:53:57,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:57,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:57,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:57,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:57,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:57,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:57,162 INFO L87 Difference]: Start difference. First operand 1119 states and 1639 transitions. Second operand 3 states. [2019-09-09 05:53:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,246 INFO L93 Difference]: Finished difference Result 1392 states and 2039 transitions. [2019-09-09 05:53:57,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:57,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-09 05:53:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:57,252 INFO L225 Difference]: With dead ends: 1392 [2019-09-09 05:53:57,252 INFO L226 Difference]: Without dead ends: 1392 [2019-09-09 05:53:57,256 INFO L628 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-09 05:53:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-09-09 05:53:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2019-09-09 05:53:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2019-09-09 05:53:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2039 transitions. [2019-09-09 05:53:57,274 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2039 transitions. Word has length 174 [2019-09-09 05:53:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:57,275 INFO L475 AbstractCegarLoop]: Abstraction has 1392 states and 2039 transitions. [2019-09-09 05:53:57,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2039 transitions. [2019-09-09 05:53:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-09 05:53:57,278 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:57,279 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2019-09-09 05:53:57,279 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:57,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1799683995, now seen corresponding path program 1 times [2019-09-09 05:53:57,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:57,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:57,416 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-09 05:53:57,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:57,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:57,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:57,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:57,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:57,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:57,418 INFO L87 Difference]: Start difference. First operand 1392 states and 2039 transitions. Second operand 3 states. [2019-09-09 05:53:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,519 INFO L93 Difference]: Finished difference Result 1665 states and 2440 transitions. [2019-09-09 05:53:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:57,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-09 05:53:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:57,527 INFO L225 Difference]: With dead ends: 1665 [2019-09-09 05:53:57,528 INFO L226 Difference]: Without dead ends: 1665 [2019-09-09 05:53:57,528 INFO L628 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-09 05:53:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2019-09-09 05:53:57,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2019-09-09 05:53:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-09-09 05:53:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2440 transitions. [2019-09-09 05:53:57,551 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2440 transitions. Word has length 206 [2019-09-09 05:53:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:57,552 INFO L475 AbstractCegarLoop]: Abstraction has 1665 states and 2440 transitions. [2019-09-09 05:53:57,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2440 transitions. [2019-09-09 05:53:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-09 05:53:57,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:57,558 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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] [2019-09-09 05:53:57,558 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash -176024399, now seen corresponding path program 1 times [2019-09-09 05:53:57,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:57,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:57,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-09-09 05:53:57,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:57,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:57,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:57,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:57,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:57,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:57,695 INFO L87 Difference]: Start difference. First operand 1665 states and 2440 transitions. Second operand 3 states. [2019-09-09 05:53:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:57,793 INFO L93 Difference]: Finished difference Result 1938 states and 2842 transitions. [2019-09-09 05:53:57,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:57,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-09-09 05:53:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:57,804 INFO L225 Difference]: With dead ends: 1938 [2019-09-09 05:53:57,805 INFO L226 Difference]: Without dead ends: 1938 [2019-09-09 05:53:57,805 INFO L628 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-09 05:53:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2019-09-09 05:53:57,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2019-09-09 05:53:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2019-09-09 05:53:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 2842 transitions. [2019-09-09 05:53:57,829 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 2842 transitions. Word has length 208 [2019-09-09 05:53:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:57,829 INFO L475 AbstractCegarLoop]: Abstraction has 1938 states and 2842 transitions. [2019-09-09 05:53:57,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 2842 transitions. [2019-09-09 05:53:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-09 05:53:57,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:57,833 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2019-09-09 05:53:57,834 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:57,834 INFO L82 PathProgramCache]: Analyzing trace with hash -613072162, now seen corresponding path program 1 times [2019-09-09 05:53:57,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:57,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:57,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:57,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-09 05:53:57,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:57,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:57,948 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:57,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:57,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:57,949 INFO L87 Difference]: Start difference. First operand 1938 states and 2842 transitions. Second operand 3 states. [2019-09-09 05:53:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:58,059 INFO L93 Difference]: Finished difference Result 2211 states and 3245 transitions. [2019-09-09 05:53:58,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:58,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-09 05:53:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,067 INFO L225 Difference]: With dead ends: 2211 [2019-09-09 05:53:58,067 INFO L226 Difference]: Without dead ends: 2211 [2019-09-09 05:53:58,067 INFO L628 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-09 05:53:58,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2019-09-09 05:53:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 2211. [2019-09-09 05:53:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2019-09-09 05:53:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 3245 transitions. [2019-09-09 05:53:58,102 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 3245 transitions. Word has length 241 [2019-09-09 05:53:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,103 INFO L475 AbstractCegarLoop]: Abstraction has 2211 states and 3245 transitions. [2019-09-09 05:53:58,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:58,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 3245 transitions. [2019-09-09 05:53:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-09 05:53:58,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,108 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2019-09-09 05:53:58,108 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,109 INFO L82 PathProgramCache]: Analyzing trace with hash 500095945, now seen corresponding path program 1 times [2019-09-09 05:53:58,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-09 05:53:58,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:58,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:58,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:58,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:58,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:58,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:58,273 INFO L87 Difference]: Start difference. First operand 2211 states and 3245 transitions. Second operand 3 states. [2019-09-09 05:53:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:58,386 INFO L93 Difference]: Finished difference Result 2476 states and 3630 transitions. [2019-09-09 05:53:58,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:58,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-09-09 05:53:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,392 INFO L225 Difference]: With dead ends: 2476 [2019-09-09 05:53:58,392 INFO L226 Difference]: Without dead ends: 2476 [2019-09-09 05:53:58,392 INFO L628 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-09 05:53:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2019-09-09 05:53:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2019-09-09 05:53:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2476 states. [2019-09-09 05:53:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3630 transitions. [2019-09-09 05:53:58,424 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3630 transitions. Word has length 276 [2019-09-09 05:53:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,424 INFO L475 AbstractCegarLoop]: Abstraction has 2476 states and 3630 transitions. [2019-09-09 05:53:58,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3630 transitions. [2019-09-09 05:53:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-09 05:53:58,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,430 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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] [2019-09-09 05:53:58,430 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,431 INFO L82 PathProgramCache]: Analyzing trace with hash 315759838, now seen corresponding path program 1 times [2019-09-09 05:53:58,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-09-09 05:53:58,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:58,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:58,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:58,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:58,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:58,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:58,628 INFO L87 Difference]: Start difference. First operand 2476 states and 3630 transitions. Second operand 3 states. [2019-09-09 05:53:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:58,771 INFO L93 Difference]: Finished difference Result 2749 states and 4035 transitions. [2019-09-09 05:53:58,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:58,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-09 05:53:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:58,779 INFO L225 Difference]: With dead ends: 2749 [2019-09-09 05:53:58,780 INFO L226 Difference]: Without dead ends: 2749 [2019-09-09 05:53:58,780 INFO L628 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-09 05:53:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2019-09-09 05:53:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2749. [2019-09-09 05:53:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2019-09-09 05:53:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 4035 transitions. [2019-09-09 05:53:58,826 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 4035 transitions. Word has length 315 [2019-09-09 05:53:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:58,827 INFO L475 AbstractCegarLoop]: Abstraction has 2749 states and 4035 transitions. [2019-09-09 05:53:58,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:58,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 4035 transitions. [2019-09-09 05:53:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-09-09 05:53:58,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:58,835 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 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-09 05:53:58,836 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:58,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1897551870, now seen corresponding path program 1 times [2019-09-09 05:53:58,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:58,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-09-09 05:53:59,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:59,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:59,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:59,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:59,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:59,054 INFO L87 Difference]: Start difference. First operand 2749 states and 4035 transitions. Second operand 3 states. [2019-09-09 05:53:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:59,150 INFO L93 Difference]: Finished difference Result 3022 states and 4441 transitions. [2019-09-09 05:53:59,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:59,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 356 [2019-09-09 05:53:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:59,157 INFO L225 Difference]: With dead ends: 3022 [2019-09-09 05:53:59,157 INFO L226 Difference]: Without dead ends: 3022 [2019-09-09 05:53:59,157 INFO L628 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-09 05:53:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2019-09-09 05:53:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2019-09-09 05:53:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2019-09-09 05:53:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 4441 transitions. [2019-09-09 05:53:59,192 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 4441 transitions. Word has length 356 [2019-09-09 05:53:59,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:59,192 INFO L475 AbstractCegarLoop]: Abstraction has 3022 states and 4441 transitions. [2019-09-09 05:53:59,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:59,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 4441 transitions. [2019-09-09 05:53:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-09 05:53:59,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:59,199 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:59,199 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash 184375628, now seen corresponding path program 1 times [2019-09-09 05:53:59,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:59,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:59,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-09-09 05:53:59,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:59,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:59,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:59,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:59,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:59,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:59,433 INFO L87 Difference]: Start difference. First operand 3022 states and 4441 transitions. Second operand 3 states. [2019-09-09 05:53:59,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:59,519 INFO L93 Difference]: Finished difference Result 3288 states and 4827 transitions. [2019-09-09 05:53:59,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:59,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 399 [2019-09-09 05:53:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:59,525 INFO L225 Difference]: With dead ends: 3288 [2019-09-09 05:53:59,526 INFO L226 Difference]: Without dead ends: 3288 [2019-09-09 05:53:59,526 INFO L628 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-09 05:53:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2019-09-09 05:53:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3288. [2019-09-09 05:53:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3288 states. [2019-09-09 05:53:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3288 states to 3288 states and 4827 transitions. [2019-09-09 05:53:59,562 INFO L78 Accepts]: Start accepts. Automaton has 3288 states and 4827 transitions. Word has length 399 [2019-09-09 05:53:59,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:59,563 INFO L475 AbstractCegarLoop]: Abstraction has 3288 states and 4827 transitions. [2019-09-09 05:53:59,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:59,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3288 states and 4827 transitions. [2019-09-09 05:53:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-09 05:53:59,569 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:59,570 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1] [2019-09-09 05:53:59,570 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash 287447201, now seen corresponding path program 1 times [2019-09-09 05:53:59,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:53:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:53:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-09-09 05:53:59,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:53:59,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:53:59,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:53:59,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:53:59,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:53:59,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:53:59,803 INFO L87 Difference]: Start difference. First operand 3288 states and 4827 transitions. Second operand 3 states. [2019-09-09 05:53:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:53:59,913 INFO L93 Difference]: Finished difference Result 3561 states and 5235 transitions. [2019-09-09 05:53:59,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:53:59,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 439 [2019-09-09 05:53:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:53:59,922 INFO L225 Difference]: With dead ends: 3561 [2019-09-09 05:53:59,922 INFO L226 Difference]: Without dead ends: 3561 [2019-09-09 05:53:59,922 INFO L628 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-09 05:53:59,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2019-09-09 05:53:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3561. [2019-09-09 05:53:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3561 states. [2019-09-09 05:53:59,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3561 states to 3561 states and 5235 transitions. [2019-09-09 05:53:59,961 INFO L78 Accepts]: Start accepts. Automaton has 3561 states and 5235 transitions. Word has length 439 [2019-09-09 05:53:59,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:53:59,962 INFO L475 AbstractCegarLoop]: Abstraction has 3561 states and 5235 transitions. [2019-09-09 05:53:59,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:53:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3561 states and 5235 transitions. [2019-09-09 05:53:59,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2019-09-09 05:53:59,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:53:59,970 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:53:59,970 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:53:59,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:53:59,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1939241564, now seen corresponding path program 1 times [2019-09-09 05:53:59,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:53:59,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:53:59,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:53:59,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-09-09 05:54:00,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:00,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:00,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:00,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:00,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:00,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:00,235 INFO L87 Difference]: Start difference. First operand 3561 states and 5235 transitions. Second operand 3 states. [2019-09-09 05:54:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:00,348 INFO L93 Difference]: Finished difference Result 3834 states and 5644 transitions. [2019-09-09 05:54:00,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:00,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 481 [2019-09-09 05:54:00,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:00,356 INFO L225 Difference]: With dead ends: 3834 [2019-09-09 05:54:00,356 INFO L226 Difference]: Without dead ends: 3834 [2019-09-09 05:54:00,356 INFO L628 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-09 05:54:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2019-09-09 05:54:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3834. [2019-09-09 05:54:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3834 states. [2019-09-09 05:54:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 5644 transitions. [2019-09-09 05:54:00,400 INFO L78 Accepts]: Start accepts. Automaton has 3834 states and 5644 transitions. Word has length 481 [2019-09-09 05:54:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:00,401 INFO L475 AbstractCegarLoop]: Abstraction has 3834 states and 5644 transitions. [2019-09-09 05:54:00,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 5644 transitions. [2019-09-09 05:54:00,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-09 05:54:00,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:00,410 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:00,410 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:00,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:00,411 INFO L82 PathProgramCache]: Analyzing trace with hash -652036810, now seen corresponding path program 1 times [2019-09-09 05:54:00,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:00,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:00,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:00,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 1481 trivial. 0 not checked. [2019-09-09 05:54:00,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:00,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:54:00,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:00,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:54:00,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:54:00,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:54:00,853 INFO L87 Difference]: Start difference. First operand 3834 states and 5644 transitions. Second operand 4 states. [2019-09-09 05:54:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:01,352 INFO L93 Difference]: Finished difference Result 5379 states and 7957 transitions. [2019-09-09 05:54:01,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:54:01,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 525 [2019-09-09 05:54:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:01,366 INFO L225 Difference]: With dead ends: 5379 [2019-09-09 05:54:01,367 INFO L226 Difference]: Without dead ends: 5379 [2019-09-09 05:54:01,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:54:01,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2019-09-09 05:54:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4408. [2019-09-09 05:54:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4408 states. [2019-09-09 05:54:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 6694 transitions. [2019-09-09 05:54:01,429 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 6694 transitions. Word has length 525 [2019-09-09 05:54:01,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:01,429 INFO L475 AbstractCegarLoop]: Abstraction has 4408 states and 6694 transitions. [2019-09-09 05:54:01,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:54:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 6694 transitions. [2019-09-09 05:54:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2019-09-09 05:54:01,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:01,441 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:01,442 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:01,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1443846598, now seen corresponding path program 1 times [2019-09-09 05:54:01,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:01,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:01,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:01,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2019-09-09 05:54:01,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:01,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:01,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:01,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:01,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:01,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:01,870 INFO L87 Difference]: Start difference. First operand 4408 states and 6694 transitions. Second operand 3 states. [2019-09-09 05:54:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:01,967 INFO L93 Difference]: Finished difference Result 4716 states and 7156 transitions. [2019-09-09 05:54:01,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:01,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 525 [2019-09-09 05:54:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:01,982 INFO L225 Difference]: With dead ends: 4716 [2019-09-09 05:54:01,982 INFO L226 Difference]: Without dead ends: 4716 [2019-09-09 05:54:01,982 INFO L628 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-09 05:54:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2019-09-09 05:54:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4716. [2019-09-09 05:54:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2019-09-09 05:54:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 7156 transitions. [2019-09-09 05:54:02,053 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 7156 transitions. Word has length 525 [2019-09-09 05:54:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:02,053 INFO L475 AbstractCegarLoop]: Abstraction has 4716 states and 7156 transitions. [2019-09-09 05:54:02,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 7156 transitions. [2019-09-09 05:54:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-09-09 05:54:02,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:02,072 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:02,073 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1977910766, now seen corresponding path program 1 times [2019-09-09 05:54:02,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2962 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 2528 trivial. 0 not checked. [2019-09-09 05:54:02,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:02,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:02,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:02,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:02,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:02,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:02,473 INFO L87 Difference]: Start difference. First operand 4716 states and 7156 transitions. Second operand 3 states. [2019-09-09 05:54:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:02,580 INFO L93 Difference]: Finished difference Result 5030 states and 7642 transitions. [2019-09-09 05:54:02,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:02,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 566 [2019-09-09 05:54:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:02,590 INFO L225 Difference]: With dead ends: 5030 [2019-09-09 05:54:02,591 INFO L226 Difference]: Without dead ends: 5030 [2019-09-09 05:54:02,591 INFO L628 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-09 05:54:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5030 states. [2019-09-09 05:54:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5030 to 5030. [2019-09-09 05:54:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5030 states. [2019-09-09 05:54:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5030 states to 5030 states and 7642 transitions. [2019-09-09 05:54:02,644 INFO L78 Accepts]: Start accepts. Automaton has 5030 states and 7642 transitions. Word has length 566 [2019-09-09 05:54:02,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:02,645 INFO L475 AbstractCegarLoop]: Abstraction has 5030 states and 7642 transitions. [2019-09-09 05:54:02,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5030 states and 7642 transitions. [2019-09-09 05:54:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-09-09 05:54:02,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:02,658 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:54:02,658 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:02,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:02,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1687259843, now seen corresponding path program 1 times [2019-09-09 05:54:02,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:02,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:02,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:02,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:03,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 2968 trivial. 0 not checked. [2019-09-09 05:54:03,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:03,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:03,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:03,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:03,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:03,113 INFO L87 Difference]: Start difference. First operand 5030 states and 7642 transitions. Second operand 3 states. [2019-09-09 05:54:03,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:03,220 INFO L93 Difference]: Finished difference Result 5344 states and 8129 transitions. [2019-09-09 05:54:03,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:03,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 609 [2019-09-09 05:54:03,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:03,229 INFO L225 Difference]: With dead ends: 5344 [2019-09-09 05:54:03,229 INFO L226 Difference]: Without dead ends: 5344 [2019-09-09 05:54:03,229 INFO L628 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-09 05:54:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2019-09-09 05:54:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2019-09-09 05:54:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-09-09 05:54:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 8129 transitions. [2019-09-09 05:54:03,300 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 8129 transitions. Word has length 609 [2019-09-09 05:54:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:03,301 INFO L475 AbstractCegarLoop]: Abstraction has 5344 states and 8129 transitions. [2019-09-09 05:54:03,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 8129 transitions. [2019-09-09 05:54:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 655 [2019-09-09 05:54:03,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:03,322 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:54:03,322 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:03,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:03,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1046145108, now seen corresponding path program 1 times [2019-09-09 05:54:03,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2019-09-09 05:54:03,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:03,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:03,730 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:03,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:03,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:03,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:03,731 INFO L87 Difference]: Start difference. First operand 5344 states and 8129 transitions. Second operand 3 states. [2019-09-09 05:54:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:03,829 INFO L93 Difference]: Finished difference Result 5653 states and 8592 transitions. [2019-09-09 05:54:03,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:03,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 654 [2019-09-09 05:54:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:03,836 INFO L225 Difference]: With dead ends: 5653 [2019-09-09 05:54:03,836 INFO L226 Difference]: Without dead ends: 5653 [2019-09-09 05:54:03,837 INFO L628 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-09 05:54:03,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5653 states. [2019-09-09 05:54:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5653 to 5653. [2019-09-09 05:54:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5653 states. [2019-09-09 05:54:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5653 states to 5653 states and 8592 transitions. [2019-09-09 05:54:03,883 INFO L78 Accepts]: Start accepts. Automaton has 5653 states and 8592 transitions. Word has length 654 [2019-09-09 05:54:03,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:03,884 INFO L475 AbstractCegarLoop]: Abstraction has 5653 states and 8592 transitions. [2019-09-09 05:54:03,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:03,884 INFO L276 IsEmpty]: Start isEmpty. Operand 5653 states and 8592 transitions. [2019-09-09 05:54:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-09-09 05:54:03,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:03,892 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:54:03,892 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash -354222234, now seen corresponding path program 1 times [2019-09-09 05:54:03,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:03,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:03,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:03,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4490 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 3946 trivial. 0 not checked. [2019-09-09 05:54:04,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:04,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:04,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:04,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:04,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:04,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:04,425 INFO L87 Difference]: Start difference. First operand 5653 states and 8592 transitions. Second operand 3 states. [2019-09-09 05:54:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:04,534 INFO L93 Difference]: Finished difference Result 5967 states and 9081 transitions. [2019-09-09 05:54:04,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:04,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 696 [2019-09-09 05:54:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:04,541 INFO L225 Difference]: With dead ends: 5967 [2019-09-09 05:54:04,541 INFO L226 Difference]: Without dead ends: 5967 [2019-09-09 05:54:04,541 INFO L628 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-09 05:54:04,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5967 states. [2019-09-09 05:54:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5967 to 5967. [2019-09-09 05:54:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5967 states. [2019-09-09 05:54:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5967 states to 5967 states and 9081 transitions. [2019-09-09 05:54:04,594 INFO L78 Accepts]: Start accepts. Automaton has 5967 states and 9081 transitions. Word has length 696 [2019-09-09 05:54:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:04,594 INFO L475 AbstractCegarLoop]: Abstraction has 5967 states and 9081 transitions. [2019-09-09 05:54:04,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 5967 states and 9081 transitions. [2019-09-09 05:54:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2019-09-09 05:54:04,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:04,602 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:54:04,603 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:04,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash 86706310, now seen corresponding path program 1 times [2019-09-09 05:54:04,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:04,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:04,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 575 proven. 0 refuted. 0 times theorem prover too weak. 4500 trivial. 0 not checked. [2019-09-09 05:54:05,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:54:05,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:54:05,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:05,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:54:05,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:54:05,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:54:05,041 INFO L87 Difference]: Start difference. First operand 5967 states and 9081 transitions. Second operand 3 states. [2019-09-09 05:54:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:05,147 INFO L93 Difference]: Finished difference Result 6281 states and 9571 transitions. [2019-09-09 05:54:05,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:54:05,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 740 [2019-09-09 05:54:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:05,155 INFO L225 Difference]: With dead ends: 6281 [2019-09-09 05:54:05,155 INFO L226 Difference]: Without dead ends: 6281 [2019-09-09 05:54:05,156 INFO L628 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-09 05:54:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6281 states. [2019-09-09 05:54:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6281 to 6281. [2019-09-09 05:54:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6281 states. [2019-09-09 05:54:05,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 9571 transitions. [2019-09-09 05:54:05,207 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 9571 transitions. Word has length 740 [2019-09-09 05:54:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:05,208 INFO L475 AbstractCegarLoop]: Abstraction has 6281 states and 9571 transitions. [2019-09-09 05:54:05,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:54:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 9571 transitions. [2019-09-09 05:54:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2019-09-09 05:54:05,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:54:05,216 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:54:05,216 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:54:05,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:05,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2014212029, now seen corresponding path program 1 times [2019-09-09 05:54:05,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:54:05,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:54:05,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:54:05,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:54:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:54:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 754 proven. 324 refuted. 0 times theorem prover too weak. 4624 trivial. 0 not checked. [2019-09-09 05:54:05,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:54:05,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:54:06,000 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 787 with the following transitions: [2019-09-09 05:54:06,002 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [143], [146], [148], [153], [156], [158], [163], [166], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [336], [341], [343], [345], [350], [353], [361], [363], [365], [368], [372], [375], [404], [407], [415], [425], [427], [430], [441], [443], [453], [455], [458], [466], [492], [495], [503], [508], [511], [519], [522], [525], [533], [535], [538], [546], [548], [551], [553], [556], [558], [561], [563], [566], [568], [571], [579], [584], [586], [588], [593], [596], [598], [601], [603], [606], [608], [611], [619], [624], [626], [629], [631], [634], [636], [639], [641], [644], [652], [657], [659], [680], [714], [716], [728], [731], [732], [744], [752], [753], [754] [2019-09-09 05:54:06,062 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:54:06,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:54:06,119 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:54:06,121 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-09 05:54:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:54:06,126 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:54:06,309 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-09 05:54:06,309 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:54:06,325 INFO L420 sIntCurrentIteration]: We unified 785 AI predicates to 785 [2019-09-09 05:54:06,325 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:54:06,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:54:06,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-09 05:54:06,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:54:06,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:54:06,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:54:06,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:54:06,329 INFO L87 Difference]: Start difference. First operand 6281 states and 9571 transitions. Second operand 2 states. [2019-09-09 05:54:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:54:06,330 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-09 05:54:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:54:06,330 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 786 [2019-09-09 05:54:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:54:06,330 INFO L225 Difference]: With dead ends: 2 [2019-09-09 05:54:06,330 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:54:06,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 785 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:54:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:54:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:54:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:54:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:54:06,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 786 [2019-09-09 05:54:06,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:54:06,332 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:54:06,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:54:06,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:54:06,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:54:06,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:54:06 BoogieIcfgContainer [2019-09-09 05:54:06,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:54:06,352 INFO L168 Benchmark]: Toolchain (without parser) took 33687.19 ms. Allocated memory was 136.8 MB in the beginning and 1.0 GB in the end (delta: 874.5 MB). Free memory was 90.7 MB in the beginning and 511.9 MB in the end (delta: -421.2 MB). Peak memory consumption was 453.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:06,353 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:54:06,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1010.77 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 90.5 MB in the beginning and 159.6 MB in the end (delta: -69.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:06,355 INFO L168 Benchmark]: Boogie Preprocessor took 172.25 ms. Allocated memory is still 203.4 MB. Free memory was 159.6 MB in the beginning and 151.1 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:06,356 INFO L168 Benchmark]: RCFGBuilder took 1562.65 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 151.1 MB in the beginning and 166.5 MB in the end (delta: -15.4 MB). Peak memory consumption was 72.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:06,357 INFO L168 Benchmark]: TraceAbstraction took 30929.15 ms. Allocated memory was 235.9 MB in the beginning and 1.0 GB in the end (delta: 775.4 MB). Free memory was 166.5 MB in the beginning and 511.9 MB in the end (delta: -345.3 MB). Peak memory consumption was 430.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:54:06,360 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.24 ms. Allocated memory is still 136.8 MB. Free memory was 111.3 MB in the beginning and 111.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1010.77 ms. Allocated memory was 136.8 MB in the beginning and 203.4 MB in the end (delta: 66.6 MB). Free memory was 90.5 MB in the beginning and 159.6 MB in the end (delta: -69.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 172.25 ms. Allocated memory is still 203.4 MB. Free memory was 159.6 MB in the beginning and 151.1 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1562.65 ms. Allocated memory was 203.4 MB in the beginning and 235.9 MB in the end (delta: 32.5 MB). Free memory was 151.1 MB in the beginning and 166.5 MB in the end (delta: -15.4 MB). Peak memory consumption was 72.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30929.15 ms. Allocated memory was 235.9 MB in the beginning and 1.0 GB in the end (delta: 775.4 MB). Free memory was 166.5 MB in the beginning and 511.9 MB in the end (delta: -345.3 MB). Peak memory consumption was 430.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1778]: 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 9 procedures, 198 locations, 1 error locations. SAFE Result, 30.8s OverallTime, 67 OverallIterations, 21 TraceHistogramMax, 18.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15989 SDtfs, 5887 SDslu, 19664 SDs, 0 SdLazy, 10171 SolverSat, 901 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1123 GetRequests, 931 SyntacticMatches, 37 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6281occurred in iteration=66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.1031847133757962 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 67 MinimizatonAttempts, 2881 StatesRemovedByMinimization, 47 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 13325 NumberOfCodeBlocks, 13325 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 13258 ConstructedInterpolants, 0 QuantifiedInterpolants, 7099532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 66 PerfectInterpolantSequences, 43791/44115 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...