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-simplified/s3_srvr_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:48:02,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:48:02,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:48:02,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:48:02,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:48:02,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:48:02,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:48:02,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:48:02,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:48:02,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:48:02,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:48:02,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:48:02,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:48:02,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:48:02,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:48:02,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:48:02,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:48:02,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:48:02,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:48:02,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:48:02,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:48:02,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:48:02,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:48:02,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:48:02,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:48:02,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:48:02,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:48:02,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:48:02,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:48:02,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:48:02,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:48:02,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:48:02,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:48:02,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:48:02,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:48:02,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:48:02,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:48:02,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:48:02,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:48:02,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:48:02,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:48:02,280 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:48:02,295 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:48:02,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:48:02,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:48:02,296 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:48:02,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:48:02,297 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:48:02,297 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:48:02,297 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:48:02,297 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:48:02,298 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:48:02,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:48:02,298 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:48:02,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:48:02,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:48:02,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:48:02,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:48:02,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:48:02,300 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:48:02,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:48:02,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:48:02,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:48:02,301 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:48:02,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:48:02,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:48:02,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:48:02,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:48:02,303 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:48:02,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:48:02,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:48:02,303 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:48:02,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:48:02,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:48:02,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:48:02,362 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:48:02,363 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:48:02,363 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-09-09 05:48:02,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebaeb3a11/aabbbc7c7e8447bb8e523adaadd3081a/FLAG7aa2cb022 [2019-09-09 05:48:02,860 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:48:02,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-09-09 05:48:02,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebaeb3a11/aabbbc7c7e8447bb8e523adaadd3081a/FLAG7aa2cb022 [2019-09-09 05:48:03,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebaeb3a11/aabbbc7c7e8447bb8e523adaadd3081a [2019-09-09 05:48:03,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:48:03,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:48:03,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:48:03,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:48:03,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:48:03,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:48:03" (1/1) ... [2019-09-09 05:48:03,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692b7d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03, skipping insertion in model container [2019-09-09 05:48:03,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:48:03" (1/1) ... [2019-09-09 05:48:03,276 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:48:03,338 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:48:03,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:48:03,747 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:48:03,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:48:03,822 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:48:03,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03 WrapperNode [2019-09-09 05:48:03,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:48:03,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:48:03,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:48:03,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:48:03,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03" (1/1) ... [2019-09-09 05:48:03,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03" (1/1) ... [2019-09-09 05:48:03,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03" (1/1) ... [2019-09-09 05:48:03,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03" (1/1) ... [2019-09-09 05:48:03,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03" (1/1) ... [2019-09-09 05:48:03,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03" (1/1) ... [2019-09-09 05:48:03,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03" (1/1) ... [2019-09-09 05:48:03,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:48:03,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:48:03,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:48:03,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:48:03,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03" (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:48:03,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:48:03,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:48:03,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:48:03,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:48:03,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:48:03,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:48:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:48:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:48:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:48:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:48:03,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:48:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:48:03,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:48:04,147 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:48:04,702 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-09 05:48:04,702 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-09 05:48:04,707 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:48:04,708 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:48:04,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:48:04 BoogieIcfgContainer [2019-09-09 05:48:04,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:48:04,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:48:04,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:48:04,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:48:04,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:48:03" (1/3) ... [2019-09-09 05:48:04,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efdf16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:48:04, skipping insertion in model container [2019-09-09 05:48:04,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:48:03" (2/3) ... [2019-09-09 05:48:04,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@efdf16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:48:04, skipping insertion in model container [2019-09-09 05:48:04,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:48:04" (3/3) ... [2019-09-09 05:48:04,728 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2019-09-09 05:48:04,740 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:48:04,749 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:48:04,766 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:48:04,790 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:48:04,790 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:48:04,791 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:48:04,791 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:48:04,791 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:48:04,791 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:48:04,791 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:48:04,791 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:48:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-09-09 05:48:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:48:04,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:04,820 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] [2019-09-09 05:48:04,823 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:04,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-09-09 05:48:04,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:04,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:04,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:04,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:04,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:05,125 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:48:05,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:05,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:05,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:05,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:05,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:05,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:05,152 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-09-09 05:48:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:05,546 INFO L93 Difference]: Finished difference Result 201 states and 337 transitions. [2019-09-09 05:48:05,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:05,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-09 05:48:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:05,561 INFO L225 Difference]: With dead ends: 201 [2019-09-09 05:48:05,561 INFO L226 Difference]: Without dead ends: 180 [2019-09-09 05:48:05,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:05,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-09 05:48:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-09-09 05:48:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-09 05:48:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-09-09 05:48:05,633 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-09-09 05:48:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:05,633 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-09-09 05:48:05,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-09-09 05:48:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:48:05,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:05,639 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] [2019-09-09 05:48:05,639 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:05,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:05,640 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-09-09 05:48:05,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:05,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:05,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:05,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:05,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:05,825 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:48:05,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:05,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:05,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:05,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:05,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:05,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:05,828 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-09-09 05:48:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:06,110 INFO L93 Difference]: Finished difference Result 223 states and 365 transitions. [2019-09-09 05:48:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:06,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-09-09 05:48:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:06,114 INFO L225 Difference]: With dead ends: 223 [2019-09-09 05:48:06,114 INFO L226 Difference]: Without dead ends: 221 [2019-09-09 05:48:06,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-09 05:48:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-09-09 05:48:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-09 05:48:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-09-09 05:48:06,129 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-09-09 05:48:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:06,129 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-09-09 05:48:06,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-09-09 05:48:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-09 05:48:06,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:06,138 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:06,138 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:06,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:06,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2018770907, now seen corresponding path program 1 times [2019-09-09 05:48:06,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:06,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:06,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:06,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:06,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:06,248 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:48:06,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:06,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:06,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:06,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:06,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:06,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:06,252 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-09-09 05:48:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:06,503 INFO L93 Difference]: Finished difference Result 247 states and 413 transitions. [2019-09-09 05:48:06,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:06,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-09-09 05:48:06,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:06,506 INFO L225 Difference]: With dead ends: 247 [2019-09-09 05:48:06,506 INFO L226 Difference]: Without dead ends: 247 [2019-09-09 05:48:06,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-09 05:48:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-09-09 05:48:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-09 05:48:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-09-09 05:48:06,519 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-09-09 05:48:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:06,519 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-09-09 05:48:06,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-09-09 05:48:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:48:06,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:06,522 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:06,523 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:06,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1670289669, now seen corresponding path program 1 times [2019-09-09 05:48:06,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:06,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:06,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:06,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:06,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:06,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:06,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:06,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:06,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:06,649 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-09-09 05:48:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:06,849 INFO L93 Difference]: Finished difference Result 264 states and 438 transitions. [2019-09-09 05:48:06,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:06,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:48:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:06,852 INFO L225 Difference]: With dead ends: 264 [2019-09-09 05:48:06,852 INFO L226 Difference]: Without dead ends: 264 [2019-09-09 05:48:06,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:06,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-09 05:48:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-09 05:48:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-09 05:48:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-09-09 05:48:06,863 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-09-09 05:48:06,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:06,863 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-09-09 05:48:06,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-09-09 05:48:06,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:48:06,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:06,867 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 05:48:06,867 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:06,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:06,867 INFO L82 PathProgramCache]: Analyzing trace with hash -288738650, now seen corresponding path program 1 times [2019-09-09 05:48:06,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:06,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:06,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:06,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:06,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:48:06,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:06,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:06,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:06,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:06,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:06,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:06,951 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-09-09 05:48:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:07,197 INFO L93 Difference]: Finished difference Result 308 states and 515 transitions. [2019-09-09 05:48:07,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:07,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:48:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:07,200 INFO L225 Difference]: With dead ends: 308 [2019-09-09 05:48:07,200 INFO L226 Difference]: Without dead ends: 308 [2019-09-09 05:48:07,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-09 05:48:07,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-09-09 05:48:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-09 05:48:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-09-09 05:48:07,210 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-09-09 05:48:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:07,210 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-09-09 05:48:07,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-09-09 05:48:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:48:07,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:07,212 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:07,212 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:07,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:07,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1782320931, now seen corresponding path program 1 times [2019-09-09 05:48:07,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:07,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:07,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:07,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:07,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:07,265 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:07,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:07,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:07,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:07,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:07,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:07,267 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-09-09 05:48:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:07,454 INFO L93 Difference]: Finished difference Result 306 states and 508 transitions. [2019-09-09 05:48:07,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:07,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:48:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:07,458 INFO L225 Difference]: With dead ends: 306 [2019-09-09 05:48:07,458 INFO L226 Difference]: Without dead ends: 306 [2019-09-09 05:48:07,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-09 05:48:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-09 05:48:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-09 05:48:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-09-09 05:48:07,466 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-09-09 05:48:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:07,467 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-09-09 05:48:07,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-09-09 05:48:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:48:07,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:07,469 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 05:48:07,469 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:07,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1133000297, now seen corresponding path program 1 times [2019-09-09 05:48:07,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:07,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:07,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:07,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:07,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:07,539 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:48:07,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:07,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:07,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:07,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:07,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:07,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:07,541 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-09-09 05:48:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:07,772 INFO L93 Difference]: Finished difference Result 308 states and 509 transitions. [2019-09-09 05:48:07,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:07,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:48:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:07,775 INFO L225 Difference]: With dead ends: 308 [2019-09-09 05:48:07,776 INFO L226 Difference]: Without dead ends: 306 [2019-09-09 05:48:07,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-09 05:48:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-09-09 05:48:07,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-09 05:48:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-09-09 05:48:07,786 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-09-09 05:48:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:07,787 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-09-09 05:48:07,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-09-09 05:48:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:48:07,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:07,789 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:07,790 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:07,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:07,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1158896476, now seen corresponding path program 1 times [2019-09-09 05:48:07,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:07,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:07,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:07,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:07,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:48:07,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:07,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:07,867 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:07,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:07,869 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-09-09 05:48:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:08,027 INFO L93 Difference]: Finished difference Result 311 states and 507 transitions. [2019-09-09 05:48:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:08,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-09 05:48:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:08,030 INFO L225 Difference]: With dead ends: 311 [2019-09-09 05:48:08,030 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:48:08,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:48:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-09-09 05:48:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-09-09 05:48:08,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-09-09 05:48:08,038 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-09-09 05:48:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:08,038 INFO L475 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-09-09 05:48:08,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-09-09 05:48:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:48:08,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:08,040 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:08,040 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:08,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:08,041 INFO L82 PathProgramCache]: Analyzing trace with hash 344707902, now seen corresponding path program 1 times [2019-09-09 05:48:08,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:08,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:08,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:08,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:08,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:08,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:08,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:08,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:08,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:08,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:08,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:08,108 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-09-09 05:48:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:08,314 INFO L93 Difference]: Finished difference Result 342 states and 556 transitions. [2019-09-09 05:48:08,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:08,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-09 05:48:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:08,318 INFO L225 Difference]: With dead ends: 342 [2019-09-09 05:48:08,318 INFO L226 Difference]: Without dead ends: 342 [2019-09-09 05:48:08,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-09 05:48:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-09-09 05:48:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-09 05:48:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-09-09 05:48:08,329 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-09-09 05:48:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:08,330 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-09-09 05:48:08,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:08,331 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-09-09 05:48:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:48:08,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:08,333 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:08,333 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1538356794, now seen corresponding path program 1 times [2019-09-09 05:48:08,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:08,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:08,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:08,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:08,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:08,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:08,409 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:08,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:08,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:08,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:08,410 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-09-09 05:48:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:08,601 INFO L93 Difference]: Finished difference Result 342 states and 552 transitions. [2019-09-09 05:48:08,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:08,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-09 05:48:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:08,608 INFO L225 Difference]: With dead ends: 342 [2019-09-09 05:48:08,608 INFO L226 Difference]: Without dead ends: 342 [2019-09-09 05:48:08,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-09 05:48:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-09-09 05:48:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-09 05:48:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-09-09 05:48:08,623 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-09-09 05:48:08,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:08,623 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-09-09 05:48:08,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-09-09 05:48:08,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:48:08,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:08,625 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:08,625 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:08,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:08,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1488538894, now seen corresponding path program 1 times [2019-09-09 05:48:08,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:08,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:08,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:08,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:08,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:08,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:08,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:08,710 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:08,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:08,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:08,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:08,711 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-09-09 05:48:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:08,907 INFO L93 Difference]: Finished difference Result 375 states and 605 transitions. [2019-09-09 05:48:08,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:08,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-09 05:48:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:08,910 INFO L225 Difference]: With dead ends: 375 [2019-09-09 05:48:08,910 INFO L226 Difference]: Without dead ends: 375 [2019-09-09 05:48:08,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-09 05:48:08,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-09-09 05:48:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:48:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-09-09 05:48:08,920 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-09-09 05:48:08,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:08,920 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-09-09 05:48:08,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-09-09 05:48:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:48:08,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:08,922 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:08,922 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:08,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:08,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1690820362, now seen corresponding path program 1 times [2019-09-09 05:48:08,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:08,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:08,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:08,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:48:08,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:08,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:08,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:08,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:08,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:08,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:08,977 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-09-09 05:48:09,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:09,173 INFO L93 Difference]: Finished difference Result 375 states and 600 transitions. [2019-09-09 05:48:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:09,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-09 05:48:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:09,176 INFO L225 Difference]: With dead ends: 375 [2019-09-09 05:48:09,176 INFO L226 Difference]: Without dead ends: 375 [2019-09-09 05:48:09,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-09 05:48:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-09-09 05:48:09,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-09-09 05:48:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-09-09 05:48:09,186 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-09-09 05:48:09,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:09,187 INFO L475 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-09-09 05:48:09,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-09-09 05:48:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:48:09,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:09,189 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:09,189 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash 478955993, now seen corresponding path program 1 times [2019-09-09 05:48:09,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:09,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:48:09,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:09,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:09,253 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:09,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:09,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:09,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:09,254 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-09-09 05:48:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:09,416 INFO L93 Difference]: Finished difference Result 393 states and 624 transitions. [2019-09-09 05:48:09,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:09,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-09 05:48:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:09,419 INFO L225 Difference]: With dead ends: 393 [2019-09-09 05:48:09,419 INFO L226 Difference]: Without dead ends: 393 [2019-09-09 05:48:09,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-09 05:48:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-09-09 05:48:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-09 05:48:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-09-09 05:48:09,428 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-09-09 05:48:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:09,428 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-09-09 05:48:09,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-09-09 05:48:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:48:09,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:09,430 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:09,431 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:09,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1822469329, now seen corresponding path program 1 times [2019-09-09 05:48:09,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:09,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:09,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:48:09,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:09,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:48:09,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:09,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:48:09,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:48:09,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:48:09,481 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-09-09 05:48:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:09,667 INFO L93 Difference]: Finished difference Result 393 states and 618 transitions. [2019-09-09 05:48:09,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:48:09,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-09 05:48:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:09,669 INFO L225 Difference]: With dead ends: 393 [2019-09-09 05:48:09,670 INFO L226 Difference]: Without dead ends: 393 [2019-09-09 05:48:09,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:48:09,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-09-09 05:48:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-09-09 05:48:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-09 05:48:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-09-09 05:48:09,679 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-09-09 05:48:09,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:09,680 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-09-09 05:48:09,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:48:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-09-09 05:48:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:48:09,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:09,682 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:09,682 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:09,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:09,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1681254182, now seen corresponding path program 1 times [2019-09-09 05:48:09,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:09,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:09,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-09 05:48:09,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:09,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:09,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:09,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:09,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:09,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:09,729 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-09-09 05:48:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:09,756 INFO L93 Difference]: Finished difference Result 761 states and 1201 transitions. [2019-09-09 05:48:09,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:09,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-09 05:48:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:09,761 INFO L225 Difference]: With dead ends: 761 [2019-09-09 05:48:09,761 INFO L226 Difference]: Without dead ends: 761 [2019-09-09 05:48:09,761 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:48:09,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-09-09 05:48:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-09-09 05:48:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-09 05:48:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-09-09 05:48:09,777 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-09-09 05:48:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:09,777 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-09-09 05:48:09,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-09-09 05:48:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:48:09,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:09,780 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:09,780 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash -837527912, now seen corresponding path program 1 times [2019-09-09 05:48:09,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:09,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:48:09,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:09,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:09,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:09,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:09,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:09,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:09,829 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-09-09 05:48:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:09,870 INFO L93 Difference]: Finished difference Result 1129 states and 1782 transitions. [2019-09-09 05:48:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:09,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-09 05:48:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:09,877 INFO L225 Difference]: With dead ends: 1129 [2019-09-09 05:48:09,877 INFO L226 Difference]: Without dead ends: 1129 [2019-09-09 05:48:09,878 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:48:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-09-09 05:48:09,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2019-09-09 05:48:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-09-09 05:48:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1782 transitions. [2019-09-09 05:48:09,908 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1782 transitions. Word has length 127 [2019-09-09 05:48:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:09,909 INFO L475 AbstractCegarLoop]: Abstraction has 1129 states and 1782 transitions. [2019-09-09 05:48:09,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1782 transitions. [2019-09-09 05:48:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:48:09,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:09,914 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:09,915 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:09,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash 551766102, now seen corresponding path program 1 times [2019-09-09 05:48:09,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:09,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:09,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:09,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-09 05:48:09,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:09,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:09,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:09,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:09,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:09,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:09,967 INFO L87 Difference]: Start difference. First operand 1129 states and 1782 transitions. Second operand 3 states. [2019-09-09 05:48:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:10,008 INFO L93 Difference]: Finished difference Result 1480 states and 2333 transitions. [2019-09-09 05:48:10,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:10,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-09 05:48:10,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:10,019 INFO L225 Difference]: With dead ends: 1480 [2019-09-09 05:48:10,019 INFO L226 Difference]: Without dead ends: 1480 [2019-09-09 05:48:10,020 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:48:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-09-09 05:48:10,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2019-09-09 05:48:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-09-09 05:48:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2333 transitions. [2019-09-09 05:48:10,075 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2333 transitions. Word has length 127 [2019-09-09 05:48:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:10,075 INFO L475 AbstractCegarLoop]: Abstraction has 1480 states and 2333 transitions. [2019-09-09 05:48:10,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2333 transitions. [2019-09-09 05:48:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:48:10,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:10,084 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 05:48:10,085 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:10,085 INFO L82 PathProgramCache]: Analyzing trace with hash -923211894, now seen corresponding path program 1 times [2019-09-09 05:48:10,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:10,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:10,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:10,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:10,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-09 05:48:10,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:10,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:10,155 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:10,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:10,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:10,156 INFO L87 Difference]: Start difference. First operand 1480 states and 2333 transitions. Second operand 3 states. [2019-09-09 05:48:10,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:10,325 INFO L93 Difference]: Finished difference Result 1520 states and 2237 transitions. [2019-09-09 05:48:10,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:10,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-09 05:48:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:10,332 INFO L225 Difference]: With dead ends: 1520 [2019-09-09 05:48:10,332 INFO L226 Difference]: Without dead ends: 1520 [2019-09-09 05:48:10,333 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:48:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-09-09 05:48:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1480. [2019-09-09 05:48:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-09-09 05:48:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2189 transitions. [2019-09-09 05:48:10,364 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2189 transitions. Word has length 164 [2019-09-09 05:48:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:10,364 INFO L475 AbstractCegarLoop]: Abstraction has 1480 states and 2189 transitions. [2019-09-09 05:48:10,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2189 transitions. [2019-09-09 05:48:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-09 05:48:10,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:10,369 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 05:48:10,369 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2015847096, now seen corresponding path program 1 times [2019-09-09 05:48:10,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:10,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:10,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:10,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:10,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-09-09 05:48:10,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:10,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:10,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:10,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:10,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:10,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:10,419 INFO L87 Difference]: Start difference. First operand 1480 states and 2189 transitions. Second operand 3 states. [2019-09-09 05:48:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:10,574 INFO L93 Difference]: Finished difference Result 1676 states and 2417 transitions. [2019-09-09 05:48:10,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:10,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-09 05:48:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:10,582 INFO L225 Difference]: With dead ends: 1676 [2019-09-09 05:48:10,582 INFO L226 Difference]: Without dead ends: 1676 [2019-09-09 05:48:10,583 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:48:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-09-09 05:48:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1560. [2019-09-09 05:48:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-09-09 05:48:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2249 transitions. [2019-09-09 05:48:10,615 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2249 transitions. Word has length 164 [2019-09-09 05:48:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:10,615 INFO L475 AbstractCegarLoop]: Abstraction has 1560 states and 2249 transitions. [2019-09-09 05:48:10,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2249 transitions. [2019-09-09 05:48:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-09 05:48:10,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:10,619 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 05:48:10,620 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:10,620 INFO L82 PathProgramCache]: Analyzing trace with hash 154922403, now seen corresponding path program 1 times [2019-09-09 05:48:10,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:10,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:10,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-09 05:48:10,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:10,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:10,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:10,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:10,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:10,671 INFO L87 Difference]: Start difference. First operand 1560 states and 2249 transitions. Second operand 3 states. [2019-09-09 05:48:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:10,896 INFO L93 Difference]: Finished difference Result 1648 states and 2304 transitions. [2019-09-09 05:48:10,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:10,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-09 05:48:10,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:10,905 INFO L225 Difference]: With dead ends: 1648 [2019-09-09 05:48:10,905 INFO L226 Difference]: Without dead ends: 1648 [2019-09-09 05:48:10,906 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:48:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-09-09 05:48:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1566. [2019-09-09 05:48:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-09-09 05:48:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2196 transitions. [2019-09-09 05:48:10,992 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2196 transitions. Word has length 178 [2019-09-09 05:48:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:10,992 INFO L475 AbstractCegarLoop]: Abstraction has 1566 states and 2196 transitions. [2019-09-09 05:48:10,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2196 transitions. [2019-09-09 05:48:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-09 05:48:11,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:11,001 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:11,001 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:11,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:11,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1961792037, now seen corresponding path program 1 times [2019-09-09 05:48:11,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:11,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:11,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:11,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:11,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-09 05:48:11,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:11,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:11,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:11,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:11,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:11,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:11,086 INFO L87 Difference]: Start difference. First operand 1566 states and 2196 transitions. Second operand 3 states. [2019-09-09 05:48:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:11,225 INFO L93 Difference]: Finished difference Result 1651 states and 2300 transitions. [2019-09-09 05:48:11,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:11,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-09-09 05:48:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:11,233 INFO L225 Difference]: With dead ends: 1651 [2019-09-09 05:48:11,233 INFO L226 Difference]: Without dead ends: 1651 [2019-09-09 05:48:11,233 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:48:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-09-09 05:48:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-09-09 05:48:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-09-09 05:48:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2280 transitions. [2019-09-09 05:48:11,269 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2280 transitions. Word has length 194 [2019-09-09 05:48:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:11,270 INFO L475 AbstractCegarLoop]: Abstraction has 1635 states and 2280 transitions. [2019-09-09 05:48:11,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2280 transitions. [2019-09-09 05:48:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-09 05:48:11,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:11,275 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:11,275 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:11,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:11,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1023005408, now seen corresponding path program 1 times [2019-09-09 05:48:11,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:11,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:11,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:11,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:11,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-09-09 05:48:11,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:11,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:11,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:11,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:11,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:11,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:11,334 INFO L87 Difference]: Start difference. First operand 1635 states and 2280 transitions. Second operand 3 states. [2019-09-09 05:48:11,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:11,449 INFO L93 Difference]: Finished difference Result 1787 states and 2484 transitions. [2019-09-09 05:48:11,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:11,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-09-09 05:48:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:11,459 INFO L225 Difference]: With dead ends: 1787 [2019-09-09 05:48:11,459 INFO L226 Difference]: Without dead ends: 1787 [2019-09-09 05:48:11,459 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:48:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-09-09 05:48:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1735. [2019-09-09 05:48:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-09-09 05:48:11,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2400 transitions. [2019-09-09 05:48:11,492 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2400 transitions. Word has length 215 [2019-09-09 05:48:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:11,493 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2400 transitions. [2019-09-09 05:48:11,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2400 transitions. [2019-09-09 05:48:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-09 05:48:11,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:11,498 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 05:48:11,498 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:11,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:11,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1880660095, now seen corresponding path program 1 times [2019-09-09 05:48:11,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:11,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:11,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-09 05:48:11,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:11,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:11,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:11,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:11,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:11,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:11,579 INFO L87 Difference]: Start difference. First operand 1735 states and 2400 transitions. Second operand 3 states. [2019-09-09 05:48:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:11,743 INFO L93 Difference]: Finished difference Result 1815 states and 2496 transitions. [2019-09-09 05:48:11,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:11,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-09-09 05:48:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:11,752 INFO L225 Difference]: With dead ends: 1815 [2019-09-09 05:48:11,752 INFO L226 Difference]: Without dead ends: 1815 [2019-09-09 05:48:11,752 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:48:11,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-09-09 05:48:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1735. [2019-09-09 05:48:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-09-09 05:48:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2392 transitions. [2019-09-09 05:48:11,784 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2392 transitions. Word has length 218 [2019-09-09 05:48:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:11,784 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2392 transitions. [2019-09-09 05:48:11,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2392 transitions. [2019-09-09 05:48:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-09 05:48:11,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:11,790 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:48:11,790 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:11,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1809038977, now seen corresponding path program 1 times [2019-09-09 05:48:11,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:11,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:11,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:11,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:11,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-09-09 05:48:11,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:11,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:11,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:11,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:11,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:11,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:11,865 INFO L87 Difference]: Start difference. First operand 1735 states and 2392 transitions. Second operand 3 states. [2019-09-09 05:48:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:11,999 INFO L93 Difference]: Finished difference Result 1931 states and 2588 transitions. [2019-09-09 05:48:12,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:12,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-09 05:48:12,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:12,008 INFO L225 Difference]: With dead ends: 1931 [2019-09-09 05:48:12,008 INFO L226 Difference]: Without dead ends: 1831 [2019-09-09 05:48:12,009 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:48:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-09-09 05:48:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1791. [2019-09-09 05:48:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-09-09 05:48:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2436 transitions. [2019-09-09 05:48:12,038 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2436 transitions. Word has length 239 [2019-09-09 05:48:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:12,039 INFO L475 AbstractCegarLoop]: Abstraction has 1791 states and 2436 transitions. [2019-09-09 05:48:12,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2436 transitions. [2019-09-09 05:48:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-09 05:48:12,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:12,044 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 05:48:12,044 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash -940069451, now seen corresponding path program 1 times [2019-09-09 05:48:12,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:12,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:12,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:12,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:12,109 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-09 05:48:12,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:48:12,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:48:12,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:12,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:48:12,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:48:12,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:48:12,111 INFO L87 Difference]: Start difference. First operand 1791 states and 2436 transitions. Second operand 3 states. [2019-09-09 05:48:12,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:48:12,227 INFO L93 Difference]: Finished difference Result 1823 states and 2468 transitions. [2019-09-09 05:48:12,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:48:12,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-09 05:48:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:48:12,238 INFO L225 Difference]: With dead ends: 1823 [2019-09-09 05:48:12,238 INFO L226 Difference]: Without dead ends: 1823 [2019-09-09 05:48:12,239 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:48:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-09-09 05:48:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1791. [2019-09-09 05:48:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-09-09 05:48:12,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2416 transitions. [2019-09-09 05:48:12,287 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2416 transitions. Word has length 241 [2019-09-09 05:48:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:48:12,287 INFO L475 AbstractCegarLoop]: Abstraction has 1791 states and 2416 transitions. [2019-09-09 05:48:12,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:48:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2416 transitions. [2019-09-09 05:48:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-09 05:48:12,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:48:12,294 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 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] [2019-09-09 05:48:12,294 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:48:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash -275540929, now seen corresponding path program 1 times [2019-09-09 05:48:12,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:48:12,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:12,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:48:12,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:48:12,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:48:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:48:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-09 05:48:12,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:48:12,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:48:12,461 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 252 with the following transitions: [2019-09-09 05:48:12,463 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [493], [498], [503], [509], [514], [516], [519], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:48:12,505 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:48:12,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:48:12,801 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:48:13,213 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:48:13,216 INFO L272 AbstractInterpreter]: Visited 90 different actions 508 times. Merged at 76 different actions 371 times. Widened at 8 different actions 15 times. Performed 1237 root evaluator evaluations with a maximum evaluation depth of 6. Performed 1237 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 38 fixpoints after 15 different actions. Largest state had 96 variables. [2019-09-09 05:48:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:48:13,221 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:48:13,668 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 93.85% of their original sizes. [2019-09-09 05:48:13,668 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:48:19,951 INFO L420 sIntCurrentIteration]: We unified 250 AI predicates to 250 [2019-09-09 05:48:19,951 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:48:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:48:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [4] total 44 [2019-09-09 05:48:19,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:48:19,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-09 05:48:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-09 05:48:19,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1383, Unknown=0, NotChecked=0, Total=1722 [2019-09-09 05:48:19,954 INFO L87 Difference]: Start difference. First operand 1791 states and 2416 transitions. Second operand 42 states. [2019-09-09 05:49:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:05,487 INFO L93 Difference]: Finished difference Result 3426 states and 4548 transitions. [2019-09-09 05:49:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-09 05:49:05,487 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 251 [2019-09-09 05:49:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:05,501 INFO L225 Difference]: With dead ends: 3426 [2019-09-09 05:49:05,501 INFO L226 Difference]: Without dead ends: 3426 [2019-09-09 05:49:05,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 166 SyntacticMatches, 44 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3006 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1123, Invalid=4729, Unknown=0, NotChecked=0, Total=5852 [2019-09-09 05:49:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2019-09-09 05:49:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3194. [2019-09-09 05:49:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2019-09-09 05:49:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4275 transitions. [2019-09-09 05:49:05,565 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4275 transitions. Word has length 251 [2019-09-09 05:49:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:05,565 INFO L475 AbstractCegarLoop]: Abstraction has 3194 states and 4275 transitions. [2019-09-09 05:49:05,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-09 05:49:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4275 transitions. [2019-09-09 05:49:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-09 05:49:05,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:05,574 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:49:05,574 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:05,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1797967949, now seen corresponding path program 1 times [2019-09-09 05:49:05,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:05,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:05,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:05,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-09 05:49:05,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:05,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:05,656 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 259 with the following transitions: [2019-09-09 05:49:05,657 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:49:05,660 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:05,661 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:06,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:06,321 INFO L272 AbstractInterpreter]: Visited 77 different actions 1265 times. Merged at 66 different actions 1060 times. Widened at 11 different actions 102 times. Performed 2961 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2961 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 123 fixpoints after 14 different actions. Largest state had 94 variables. [2019-09-09 05:49:06,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:06,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:06,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:06,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:49:06,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:06,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:06,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:06,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-09 05:49:06,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-09 05:49:06,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:49:06,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:49:06,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:49:06,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:49:06,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:49:06,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:49:06,605 INFO L87 Difference]: Start difference. First operand 3194 states and 4275 transitions. Second operand 4 states. [2019-09-09 05:49:07,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:07,011 INFO L93 Difference]: Finished difference Result 6682 states and 8681 transitions. [2019-09-09 05:49:07,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:07,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-09 05:49:07,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:07,026 INFO L225 Difference]: With dead ends: 6682 [2019-09-09 05:49:07,026 INFO L226 Difference]: Without dead ends: 6682 [2019-09-09 05:49:07,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:49:07,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6682 states. [2019-09-09 05:49:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6682 to 3957. [2019-09-09 05:49:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3957 states. [2019-09-09 05:49:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3957 states and 5180 transitions. [2019-09-09 05:49:07,098 INFO L78 Accepts]: Start accepts. Automaton has 3957 states and 5180 transitions. Word has length 258 [2019-09-09 05:49:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:07,098 INFO L475 AbstractCegarLoop]: Abstraction has 3957 states and 5180 transitions. [2019-09-09 05:49:07,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:49:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3957 states and 5180 transitions. [2019-09-09 05:49:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-09 05:49:07,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:07,108 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-09-09 05:49:07,109 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:07,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:07,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1509148559, now seen corresponding path program 1 times [2019-09-09 05:49:07,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:07,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:07,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:07,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:07,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-09 05:49:07,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:07,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:07,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:07,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:07,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:07,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:07,193 INFO L87 Difference]: Start difference. First operand 3957 states and 5180 transitions. Second operand 3 states. [2019-09-09 05:49:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:07,222 INFO L93 Difference]: Finished difference Result 6803 states and 8966 transitions. [2019-09-09 05:49:07,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:07,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-09-09 05:49:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:07,235 INFO L225 Difference]: With dead ends: 6803 [2019-09-09 05:49:07,235 INFO L226 Difference]: Without dead ends: 6803 [2019-09-09 05:49:07,235 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:49:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6803 states. [2019-09-09 05:49:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6803 to 6801. [2019-09-09 05:49:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6801 states. [2019-09-09 05:49:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6801 states to 6801 states and 8965 transitions. [2019-09-09 05:49:07,317 INFO L78 Accepts]: Start accepts. Automaton has 6801 states and 8965 transitions. Word has length 258 [2019-09-09 05:49:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:07,317 INFO L475 AbstractCegarLoop]: Abstraction has 6801 states and 8965 transitions. [2019-09-09 05:49:07,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:07,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6801 states and 8965 transitions. [2019-09-09 05:49:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-09 05:49:07,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:07,335 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:07,335 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash -718445864, now seen corresponding path program 1 times [2019-09-09 05:49:07,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:07,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:07,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:07,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:07,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-09-09 05:49:07,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:07,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:07,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:07,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:07,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:07,450 INFO L87 Difference]: Start difference. First operand 6801 states and 8965 transitions. Second operand 3 states. [2019-09-09 05:49:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:07,661 INFO L93 Difference]: Finished difference Result 6957 states and 9058 transitions. [2019-09-09 05:49:07,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:07,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-09 05:49:07,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:07,682 INFO L225 Difference]: With dead ends: 6957 [2019-09-09 05:49:07,682 INFO L226 Difference]: Without dead ends: 6957 [2019-09-09 05:49:07,682 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:49:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-09-09 05:49:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 6802. [2019-09-09 05:49:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6802 states. [2019-09-09 05:49:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6802 states to 6802 states and 8862 transitions. [2019-09-09 05:49:07,858 INFO L78 Accepts]: Start accepts. Automaton has 6802 states and 8862 transitions. Word has length 261 [2019-09-09 05:49:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:07,858 INFO L475 AbstractCegarLoop]: Abstraction has 6802 states and 8862 transitions. [2019-09-09 05:49:07,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 6802 states and 8862 transitions. [2019-09-09 05:49:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-09 05:49:07,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:07,871 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:07,871 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:07,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash -571590843, now seen corresponding path program 1 times [2019-09-09 05:49:07,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:07,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:07,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:07,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:07,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-09-09 05:49:07,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:07,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:07,970 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2019-09-09 05:49:07,971 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [50], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [225], [227], [230], [234], [238], [253], [259], [269], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:49:07,977 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:07,977 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:08,866 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:08,868 INFO L272 AbstractInterpreter]: Visited 87 different actions 1468 times. Merged at 76 different actions 1208 times. Widened at 14 different actions 118 times. Performed 3541 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3541 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 157 fixpoints after 17 different actions. Largest state had 95 variables. [2019-09-09 05:49:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:08,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:08,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:08,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:49:08,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:08,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:08,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:08,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-09-09 05:49:09,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:09,080 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-09-09 05:49:09,083 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:09,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:49:09,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:09,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:09,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:09,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:09,085 INFO L87 Difference]: Start difference. First operand 6802 states and 8862 transitions. Second operand 3 states. [2019-09-09 05:49:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:09,225 INFO L93 Difference]: Finished difference Result 6828 states and 8876 transitions. [2019-09-09 05:49:09,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:09,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-09-09 05:49:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:09,237 INFO L225 Difference]: With dead ends: 6828 [2019-09-09 05:49:09,237 INFO L226 Difference]: Without dead ends: 6828 [2019-09-09 05:49:09,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6828 states. [2019-09-09 05:49:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6828 to 6802. [2019-09-09 05:49:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6802 states. [2019-09-09 05:49:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6802 states to 6802 states and 8850 transitions. [2019-09-09 05:49:09,392 INFO L78 Accepts]: Start accepts. Automaton has 6802 states and 8850 transitions. Word has length 287 [2019-09-09 05:49:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:09,392 INFO L475 AbstractCegarLoop]: Abstraction has 6802 states and 8850 transitions. [2019-09-09 05:49:09,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6802 states and 8850 transitions. [2019-09-09 05:49:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-09 05:49:09,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:09,404 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:09,405 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:09,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:09,405 INFO L82 PathProgramCache]: Analyzing trace with hash 232140181, now seen corresponding path program 1 times [2019-09-09 05:49:09,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:09,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:09,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:09,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:09,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-09-09 05:49:09,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:09,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:09,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2019-09-09 05:49:09,510 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [50], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [225], [227], [230], [234], [238], [253], [259], [262], [267], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:49:09,517 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:09,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:10,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:10,255 INFO L272 AbstractInterpreter]: Visited 87 different actions 1369 times. Merged at 75 different actions 1120 times. Widened at 12 different actions 108 times. Performed 3232 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 136 fixpoints after 17 different actions. Largest state had 95 variables. [2019-09-09 05:49:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:10,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:10,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:10,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:10,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:10,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:10,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:10,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-09 05:49:10,389 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:10,435 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-09 05:49:10,447 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:10,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:49:10,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:10,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:10,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:10,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:10,449 INFO L87 Difference]: Start difference. First operand 6802 states and 8850 transitions. Second operand 3 states. [2019-09-09 05:49:10,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:10,558 INFO L93 Difference]: Finished difference Result 6802 states and 8838 transitions. [2019-09-09 05:49:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:10,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-09-09 05:49:10,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:10,570 INFO L225 Difference]: With dead ends: 6802 [2019-09-09 05:49:10,570 INFO L226 Difference]: Without dead ends: 6802 [2019-09-09 05:49:10,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 576 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:10,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6802 states. [2019-09-09 05:49:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6802 to 6802. [2019-09-09 05:49:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6802 states. [2019-09-09 05:49:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6802 states to 6802 states and 8838 transitions. [2019-09-09 05:49:11,027 INFO L78 Accepts]: Start accepts. Automaton has 6802 states and 8838 transitions. Word has length 288 [2019-09-09 05:49:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:11,028 INFO L475 AbstractCegarLoop]: Abstraction has 6802 states and 8838 transitions. [2019-09-09 05:49:11,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 6802 states and 8838 transitions. [2019-09-09 05:49:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-09 05:49:11,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:11,040 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:11,041 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:11,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:11,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2074361303, now seen corresponding path program 1 times [2019-09-09 05:49:11,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:11,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:11,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:11,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:11,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:11,145 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-09-09 05:49:11,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:11,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:11,145 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 289 with the following transitions: [2019-09-09 05:49:11,147 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [55], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [117], [122], [127], [132], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [192], [197], [200], [202], [207], [210], [227], [230], [234], [238], [253], [259], [262], [267], [281], [284], [286], [292], [294], [297], [299], [302], [310], [313], [317], [443], [445], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [529], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:49:11,150 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:11,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:12,196 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:12,197 INFO L272 AbstractInterpreter]: Visited 87 different actions 1517 times. Merged at 76 different actions 1251 times. Widened at 12 different actions 116 times. Performed 3764 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3764 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 163 fixpoints after 18 different actions. Largest state had 95 variables. [2019-09-09 05:49:12,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:12,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:12,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:12,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:12,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:12,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:12,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:12,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-09-09 05:49:12,417 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-09-09 05:49:12,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:49:12,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:49:12,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:49:12,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:49:12,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:49:12,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:49:12,547 INFO L87 Difference]: Start difference. First operand 6802 states and 8838 transitions. Second operand 4 states. [2019-09-09 05:49:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:12,959 INFO L93 Difference]: Finished difference Result 9794 states and 12459 transitions. [2019-09-09 05:49:12,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:12,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-09-09 05:49:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:12,975 INFO L225 Difference]: With dead ends: 9794 [2019-09-09 05:49:12,975 INFO L226 Difference]: Without dead ends: 9702 [2019-09-09 05:49:12,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:49:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9702 states. [2019-09-09 05:49:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 6068. [2019-09-09 05:49:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6068 states. [2019-09-09 05:49:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6068 states to 6068 states and 7777 transitions. [2019-09-09 05:49:13,079 INFO L78 Accepts]: Start accepts. Automaton has 6068 states and 7777 transitions. Word has length 288 [2019-09-09 05:49:13,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:13,079 INFO L475 AbstractCegarLoop]: Abstraction has 6068 states and 7777 transitions. [2019-09-09 05:49:13,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:49:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 6068 states and 7777 transitions. [2019-09-09 05:49:13,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-09 05:49:13,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:13,117 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:13,118 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:13,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:13,118 INFO L82 PathProgramCache]: Analyzing trace with hash 924837848, now seen corresponding path program 1 times [2019-09-09 05:49:13,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:13,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:13,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-09-09 05:49:13,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:13,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:13,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:13,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:13,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:13,210 INFO L87 Difference]: Start difference. First operand 6068 states and 7777 transitions. Second operand 3 states. [2019-09-09 05:49:13,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:13,319 INFO L93 Difference]: Finished difference Result 4408 states and 5485 transitions. [2019-09-09 05:49:13,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:13,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-09 05:49:13,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:13,325 INFO L225 Difference]: With dead ends: 4408 [2019-09-09 05:49:13,326 INFO L226 Difference]: Without dead ends: 3204 [2019-09-09 05:49:13,328 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:49:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2019-09-09 05:49:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 3204. [2019-09-09 05:49:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3204 states. [2019-09-09 05:49:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 4059 transitions. [2019-09-09 05:49:13,358 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 4059 transitions. Word has length 326 [2019-09-09 05:49:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:13,358 INFO L475 AbstractCegarLoop]: Abstraction has 3204 states and 4059 transitions. [2019-09-09 05:49:13,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 4059 transitions. [2019-09-09 05:49:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-09 05:49:13,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:13,365 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-09 05:49:13,365 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:13,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:13,365 INFO L82 PathProgramCache]: Analyzing trace with hash 4925057, now seen corresponding path program 1 times [2019-09-09 05:49:13,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:13,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:13,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-09-09 05:49:13,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:13,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:13,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:13,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:13,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:13,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:13,482 INFO L87 Difference]: Start difference. First operand 3204 states and 4059 transitions. Second operand 3 states. [2019-09-09 05:49:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:13,596 INFO L93 Difference]: Finished difference Result 3218 states and 4038 transitions. [2019-09-09 05:49:13,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:13,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-09-09 05:49:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:13,602 INFO L225 Difference]: With dead ends: 3218 [2019-09-09 05:49:13,602 INFO L226 Difference]: Without dead ends: 3218 [2019-09-09 05:49:13,602 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:49:13,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2019-09-09 05:49:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3204. [2019-09-09 05:49:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3204 states. [2019-09-09 05:49:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 4024 transitions. [2019-09-09 05:49:13,631 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 4024 transitions. Word has length 365 [2019-09-09 05:49:13,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:13,632 INFO L475 AbstractCegarLoop]: Abstraction has 3204 states and 4024 transitions. [2019-09-09 05:49:13,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 4024 transitions. [2019-09-09 05:49:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-09 05:49:13,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:13,639 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-09-09 05:49:13,639 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:13,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:13,639 INFO L82 PathProgramCache]: Analyzing trace with hash 85240782, now seen corresponding path program 1 times [2019-09-09 05:49:13,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:13,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:13,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-09-09 05:49:13,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:13,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:13,797 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 399 with the following transitions: [2019-09-09 05:49:13,798 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [313], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:49:13,800 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:13,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:13,880 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:15,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:15,298 INFO L272 AbstractInterpreter]: Visited 101 different actions 2436 times. Merged at 89 different actions 2025 times. Widened at 20 different actions 308 times. Performed 5757 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5757 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 298 fixpoints after 36 different actions. Largest state had 97 variables. [2019-09-09 05:49:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:15,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:15,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:15,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:15,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:15,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:15,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:15,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-09-09 05:49:15,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:15,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-09-09 05:49:15,617 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:15,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:49:15,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:15,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:15,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:15,619 INFO L87 Difference]: Start difference. First operand 3204 states and 4024 transitions. Second operand 3 states. [2019-09-09 05:49:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:15,640 INFO L93 Difference]: Finished difference Result 3757 states and 4757 transitions. [2019-09-09 05:49:15,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:15,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-09-09 05:49:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:15,648 INFO L225 Difference]: With dead ends: 3757 [2019-09-09 05:49:15,648 INFO L226 Difference]: Without dead ends: 3757 [2019-09-09 05:49:15,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 796 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2019-09-09 05:49:15,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3114. [2019-09-09 05:49:15,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2019-09-09 05:49:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 3923 transitions. [2019-09-09 05:49:15,687 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 3923 transitions. Word has length 398 [2019-09-09 05:49:15,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:15,687 INFO L475 AbstractCegarLoop]: Abstraction has 3114 states and 3923 transitions. [2019-09-09 05:49:15,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 3923 transitions. [2019-09-09 05:49:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-09-09 05:49:15,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:15,696 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 05:49:15,696 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:15,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1661102763, now seen corresponding path program 1 times [2019-09-09 05:49:15,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:15,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:15,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:15,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:15,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-09-09 05:49:15,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:15,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:15,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 539 with the following transitions: [2019-09-09 05:49:15,957 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:49:15,959 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:15,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:16,004 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:16,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:16,912 INFO L272 AbstractInterpreter]: Visited 100 different actions 2117 times. Merged at 86 different actions 1752 times. Widened at 18 different actions 251 times. Performed 4872 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4872 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 232 fixpoints after 27 different actions. Largest state had 97 variables. [2019-09-09 05:49:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:16,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:16,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:16,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:16,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:16,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:17,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:17,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-09-09 05:49:17,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-09-09 05:49:17,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:49:17,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:49:17,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:49:17,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:49:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:49:17,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:49:17,302 INFO L87 Difference]: Start difference. First operand 3114 states and 3923 transitions. Second operand 4 states. [2019-09-09 05:49:17,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:17,609 INFO L93 Difference]: Finished difference Result 4271 states and 5347 transitions. [2019-09-09 05:49:17,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:17,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 538 [2019-09-09 05:49:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:17,617 INFO L225 Difference]: With dead ends: 4271 [2019-09-09 05:49:17,617 INFO L226 Difference]: Without dead ends: 4217 [2019-09-09 05:49:17,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 1076 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:49:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4217 states. [2019-09-09 05:49:17,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4217 to 3198. [2019-09-09 05:49:17,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3198 states. [2019-09-09 05:49:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 4035 transitions. [2019-09-09 05:49:17,652 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 4035 transitions. Word has length 538 [2019-09-09 05:49:17,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:17,653 INFO L475 AbstractCegarLoop]: Abstraction has 3198 states and 4035 transitions. [2019-09-09 05:49:17,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:49:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 4035 transitions. [2019-09-09 05:49:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-09-09 05:49:17,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:17,661 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:17,661 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:17,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1238623897, now seen corresponding path program 1 times [2019-09-09 05:49:17,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:17,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:17,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:17,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:17,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-09-09 05:49:17,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:17,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:17,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:17,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:17,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:17,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:17,911 INFO L87 Difference]: Start difference. First operand 3198 states and 4035 transitions. Second operand 3 states. [2019-09-09 05:49:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:18,048 INFO L93 Difference]: Finished difference Result 3450 states and 4321 transitions. [2019-09-09 05:49:18,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:18,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 600 [2019-09-09 05:49:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:18,055 INFO L225 Difference]: With dead ends: 3450 [2019-09-09 05:49:18,056 INFO L226 Difference]: Without dead ends: 3450 [2019-09-09 05:49:18,056 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:49:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2019-09-09 05:49:18,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3436. [2019-09-09 05:49:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2019-09-09 05:49:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 4307 transitions. [2019-09-09 05:49:18,088 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 4307 transitions. Word has length 600 [2019-09-09 05:49:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:18,089 INFO L475 AbstractCegarLoop]: Abstraction has 3436 states and 4307 transitions. [2019-09-09 05:49:18,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 4307 transitions. [2019-09-09 05:49:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-09-09 05:49:18,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:18,097 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:18,097 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1437228011, now seen corresponding path program 1 times [2019-09-09 05:49:18,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:18,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:18,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:18,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2019-09-09 05:49:18,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:18,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:18,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:18,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:18,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:18,328 INFO L87 Difference]: Start difference. First operand 3436 states and 4307 transitions. Second operand 3 states. [2019-09-09 05:49:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:18,469 INFO L93 Difference]: Finished difference Result 3431 states and 4232 transitions. [2019-09-09 05:49:18,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:18,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2019-09-09 05:49:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:18,472 INFO L225 Difference]: With dead ends: 3431 [2019-09-09 05:49:18,472 INFO L226 Difference]: Without dead ends: 3431 [2019-09-09 05:49:18,473 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:49:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3431 states. [2019-09-09 05:49:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3431 to 3429. [2019-09-09 05:49:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3429 states. [2019-09-09 05:49:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4230 transitions. [2019-09-09 05:49:18,501 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 4230 transitions. Word has length 662 [2019-09-09 05:49:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:18,501 INFO L475 AbstractCegarLoop]: Abstraction has 3429 states and 4230 transitions. [2019-09-09 05:49:18,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4230 transitions. [2019-09-09 05:49:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2019-09-09 05:49:18,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:18,510 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:18,510 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:18,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1078284281, now seen corresponding path program 1 times [2019-09-09 05:49:18,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:18,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:18,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:18,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:18,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-09-09 05:49:18,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:18,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:18,873 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 729 with the following transitions: [2019-09-09 05:49:18,874 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [160], [162], [167], [170], [172], [177], [180], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [299], [302], [310], [315], [317], [319], [322], [331], [333], [336], [342], [372], [377], [387], [391], [402], [404], [414], [416], [421], [443], [445], [447], [452], [457], [462], [465], [470], [472], [477], [479], [484], [489], [491], [493], [498], [501], [503], [509], [514], [516], [519], [521], [526], [531], [533], [587], [589], [601], [604], [605], [606], [608] [2019-09-09 05:49:18,875 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:18,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:18,921 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:19,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:19,784 INFO L272 AbstractInterpreter]: Visited 111 different actions 2336 times. Merged at 94 different actions 1882 times. Widened at 21 different actions 288 times. Performed 5547 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5547 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 286 fixpoints after 33 different actions. Largest state had 101 variables. [2019-09-09 05:49:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:19,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:19,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:19,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:19,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:19,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:19,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:19,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-09-09 05:49:20,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-09-09 05:49:20,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:49:20,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:49:20,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:49:20,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:49:20,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:49:20,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:49:20,429 INFO L87 Difference]: Start difference. First operand 3429 states and 4230 transitions. Second operand 4 states. [2019-09-09 05:49:20,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:20,614 INFO L93 Difference]: Finished difference Result 2908 states and 3540 transitions. [2019-09-09 05:49:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:49:20,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 728 [2019-09-09 05:49:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:20,621 INFO L225 Difference]: With dead ends: 2908 [2019-09-09 05:49:20,621 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:49:20,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1461 GetRequests, 1456 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:49:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:49:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:49:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:49:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:49:20,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 728 [2019-09-09 05:49:20,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:20,623 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:49:20,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:49:20,624 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:49:20,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:49:20,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:49:20 BoogieIcfgContainer [2019-09-09 05:49:20,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:49:20,631 INFO L168 Benchmark]: Toolchain (without parser) took 77372.35 ms. Allocated memory was 132.6 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 88.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:20,632 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 106.9 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:49:20,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.72 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 88.1 MB in the beginning and 171.4 MB in the end (delta: -83.3 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:20,633 INFO L168 Benchmark]: Boogie Preprocessor took 62.31 ms. Allocated memory is still 199.2 MB. Free memory was 171.4 MB in the beginning and 168.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:20,634 INFO L168 Benchmark]: RCFGBuilder took 823.57 ms. Allocated memory is still 199.2 MB. Free memory was 168.2 MB in the beginning and 119.6 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:20,637 INFO L168 Benchmark]: TraceAbstraction took 75917.73 ms. Allocated memory was 199.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 119.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:20,645 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.20 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 563.72 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 88.1 MB in the beginning and 171.4 MB in the end (delta: -83.3 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.31 ms. Allocated memory is still 199.2 MB. Free memory was 171.4 MB in the beginning and 168.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.57 ms. Allocated memory is still 199.2 MB. Free memory was 168.2 MB in the beginning and 119.6 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75917.73 ms. Allocated memory was 199.2 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 119.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: 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 4 procedures, 149 locations, 1 error locations. SAFE Result, 75.8s OverallTime, 39 OverallIterations, 24 TraceHistogramMax, 52.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7873 SDtfs, 10182 SDslu, 6591 SDs, 0 SdLazy, 10791 SolverSat, 1485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6020 GetRequests, 5798 SyntacticMatches, 45 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3010 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6802occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.4s AbstIntTime, 8 AbstIntIterations, 1 AbstIntStrong, 0.750554499478248 AbsIntWeakeningRatio, 0.46 AbsIntAvgWeakeningVarsNumRemoved, 36.176 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 8976 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 11561 NumberOfCodeBlocks, 11561 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 14293 ConstructedInterpolants, 0 QuantifiedInterpolants, 7000364 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4842 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 53 InterpolantComputations, 37 PerfectInterpolantSequences, 57446/57690 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...