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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:27:43,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:27:43,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:27:43,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:27:43,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:27:43,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:27:43,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:27:43,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:27:43,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:27:43,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:27:43,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:27:43,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:27:43,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:27:43,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:27:43,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:27:43,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:27:43,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:27:43,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:27:43,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:27:43,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:27:43,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:27:43,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:27:43,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:27:43,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:27:43,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:27:43,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:27:43,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:27:43,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:27:43,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:27:43,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:27:43,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:27:43,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:27:43,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:27:43,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:27:43,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:27:43,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:27:43,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:27:43,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:27:43,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:27:43,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:27:43,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:27:43,753 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:27:43,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:27:43,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:27:43,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:27:43,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:27:43,790 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:27:43,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:27:43,790 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:27:43,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:27:43,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:27:43,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:27:43,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:27:43,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:27:43,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:27:43,792 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:27:43,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:27:43,792 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:27:43,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:27:43,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:27:43,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:27:43,793 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:27:43,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:27:43,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:43,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:27:43,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:27:43,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:27:43,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:27:43,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:27:43,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:27:43,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:27:44,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:27:44,066 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:27:44,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:27:44,071 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:27:44,071 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:27:44,072 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-10-15 01:27:44,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27549b88/f74c5e726188425b8fa4b38f92370eac/FLAGcfbb32664 [2019-10-15 01:27:44,627 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:27:44,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_1.cil-2.c [2019-10-15 01:27:44,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27549b88/f74c5e726188425b8fa4b38f92370eac/FLAGcfbb32664 [2019-10-15 01:27:44,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27549b88/f74c5e726188425b8fa4b38f92370eac [2019-10-15 01:27:44,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:27:44,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:27:44,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:44,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:27:44,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:27:44,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:44" (1/1) ... [2019-10-15 01:27:44,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e246330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:44, skipping insertion in model container [2019-10-15 01:27:44,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:27:44" (1/1) ... [2019-10-15 01:27:45,006 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:27:45,045 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:27:45,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:45,495 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:27:45,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:27:45,580 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:27:45,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:45 WrapperNode [2019-10-15 01:27:45,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:27:45,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:27:45,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:27:45,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:27:45,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:45" (1/1) ... [2019-10-15 01:27:45,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:45" (1/1) ... [2019-10-15 01:27:45,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:45" (1/1) ... [2019-10-15 01:27:45,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:45" (1/1) ... [2019-10-15 01:27:45,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:45" (1/1) ... [2019-10-15 01:27:45,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:45" (1/1) ... [2019-10-15 01:27:45,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:45" (1/1) ... [2019-10-15 01:27:45,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:27:45,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:27:45,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:27:45,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:27:45,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:27:45,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:27:45,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:27:45,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-15 01:27:45,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR [2019-10-15 01:27:45,710 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:27:45,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:27:45,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:27:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:27:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 01:27:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 01:27:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure ERR [2019-10-15 01:27:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-15 01:27:45,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:27:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:27:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:27:45,931 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 01:27:46,467 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-15 01:27:46,468 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-15 01:27:46,470 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:27:46,471 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:27:46,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:46 BoogieIcfgContainer [2019-10-15 01:27:46,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:27:46,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:27:46,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:27:46,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:27:46,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:27:44" (1/3) ... [2019-10-15 01:27:46,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a457c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:46, skipping insertion in model container [2019-10-15 01:27:46,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:27:45" (2/3) ... [2019-10-15 01:27:46,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a457c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:27:46, skipping insertion in model container [2019-10-15 01:27:46,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:27:46" (3/3) ... [2019-10-15 01:27:46,491 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-2.c [2019-10-15 01:27:46,503 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:27:46,512 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:27:46,523 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:27:46,561 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:27:46,561 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:27:46,561 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:27:46,562 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:27:46,562 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:27:46,562 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:27:46,562 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:27:46,562 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:27:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-15 01:27:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 01:27:46,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:46,594 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:46,596 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:46,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:46,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1696698376, now seen corresponding path program 1 times [2019-10-15 01:27:46,607 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:46,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205226521] [2019-10-15 01:27:46,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,608 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:46,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:46,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205226521] [2019-10-15 01:27:46,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:46,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:46,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487309331] [2019-10-15 01:27:46,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:46,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:46,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:46,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:46,901 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-10-15 01:27:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:47,374 INFO L93 Difference]: Finished difference Result 345 states and 585 transitions. [2019-10-15 01:27:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:47,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-15 01:27:47,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:47,398 INFO L225 Difference]: With dead ends: 345 [2019-10-15 01:27:47,398 INFO L226 Difference]: Without dead ends: 183 [2019-10-15 01:27:47,406 INFO L600 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-10-15 01:27:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-15 01:27:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 178. [2019-10-15 01:27:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-15 01:27:47,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 284 transitions. [2019-10-15 01:27:47,486 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 284 transitions. Word has length 51 [2019-10-15 01:27:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:47,489 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 284 transitions. [2019-10-15 01:27:47,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 284 transitions. [2019-10-15 01:27:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-15 01:27:47,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:47,492 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:47,493 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:47,493 INFO L82 PathProgramCache]: Analyzing trace with hash 742008338, now seen corresponding path program 1 times [2019-10-15 01:27:47,494 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:47,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620642499] [2019-10-15 01:27:47,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:47,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:47,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620642499] [2019-10-15 01:27:47,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:47,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:47,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853075944] [2019-10-15 01:27:47,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:47,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:47,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:47,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:47,659 INFO L87 Difference]: Start difference. First operand 178 states and 284 transitions. Second operand 5 states. [2019-10-15 01:27:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:47,971 INFO L93 Difference]: Finished difference Result 391 states and 639 transitions. [2019-10-15 01:27:47,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:47,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-10-15 01:27:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:47,975 INFO L225 Difference]: With dead ends: 391 [2019-10-15 01:27:47,976 INFO L226 Difference]: Without dead ends: 224 [2019-10-15 01:27:47,979 INFO L600 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-10-15 01:27:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-15 01:27:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2019-10-15 01:27:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-15 01:27:48,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 361 transitions. [2019-10-15 01:27:48,021 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 361 transitions. Word has length 52 [2019-10-15 01:27:48,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:48,022 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 361 transitions. [2019-10-15 01:27:48,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 361 transitions. [2019-10-15 01:27:48,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 01:27:48,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:48,030 INFO L380 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, 1, 1, 1] [2019-10-15 01:27:48,031 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:48,034 INFO L82 PathProgramCache]: Analyzing trace with hash 201696029, now seen corresponding path program 1 times [2019-10-15 01:27:48,034 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:48,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067747137] [2019-10-15 01:27:48,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:48,035 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:48,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:48,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067747137] [2019-10-15 01:27:48,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:48,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:48,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636477367] [2019-10-15 01:27:48,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:48,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:48,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:48,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:48,174 INFO L87 Difference]: Start difference. First operand 219 states and 361 transitions. Second operand 5 states. [2019-10-15 01:27:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:48,416 INFO L93 Difference]: Finished difference Result 456 states and 763 transitions. [2019-10-15 01:27:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:48,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-15 01:27:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:48,420 INFO L225 Difference]: With dead ends: 456 [2019-10-15 01:27:48,420 INFO L226 Difference]: Without dead ends: 250 [2019-10-15 01:27:48,426 INFO L600 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-10-15 01:27:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-15 01:27:48,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2019-10-15 01:27:48,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-10-15 01:27:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 417 transitions. [2019-10-15 01:27:48,458 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 417 transitions. Word has length 80 [2019-10-15 01:27:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:48,459 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 417 transitions. [2019-10-15 01:27:48,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 417 transitions. [2019-10-15 01:27:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-15 01:27:48,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:48,464 INFO L380 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, 1, 1] [2019-10-15 01:27:48,465 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:48,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:48,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1556256498, now seen corresponding path program 1 times [2019-10-15 01:27:48,469 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:48,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142495723] [2019-10-15 01:27:48,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:48,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:48,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:48,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142495723] [2019-10-15 01:27:48,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:48,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:48,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036719335] [2019-10-15 01:27:48,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:48,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:48,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:48,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:48,616 INFO L87 Difference]: Start difference. First operand 250 states and 417 transitions. Second operand 5 states. [2019-10-15 01:27:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:48,854 INFO L93 Difference]: Finished difference Result 533 states and 899 transitions. [2019-10-15 01:27:48,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:48,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-15 01:27:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:48,859 INFO L225 Difference]: With dead ends: 533 [2019-10-15 01:27:48,859 INFO L226 Difference]: Without dead ends: 296 [2019-10-15 01:27:48,860 INFO L600 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-10-15 01:27:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-15 01:27:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 292. [2019-10-15 01:27:48,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-15 01:27:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 492 transitions. [2019-10-15 01:27:48,882 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 492 transitions. Word has length 91 [2019-10-15 01:27:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:48,884 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 492 transitions. [2019-10-15 01:27:48,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 492 transitions. [2019-10-15 01:27:48,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:27:48,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:48,887 INFO L380 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, 1, 1] [2019-10-15 01:27:48,887 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:48,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1933322156, now seen corresponding path program 1 times [2019-10-15 01:27:48,888 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:48,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358017116] [2019-10-15 01:27:48,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:48,889 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:48,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:27:48,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358017116] [2019-10-15 01:27:48,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:48,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:48,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136295844] [2019-10-15 01:27:48,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:48,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:48,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:48,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:48,995 INFO L87 Difference]: Start difference. First operand 292 states and 492 transitions. Second operand 5 states. [2019-10-15 01:27:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:49,228 INFO L93 Difference]: Finished difference Result 575 states and 972 transitions. [2019-10-15 01:27:49,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:49,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-15 01:27:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:49,231 INFO L225 Difference]: With dead ends: 575 [2019-10-15 01:27:49,231 INFO L226 Difference]: Without dead ends: 294 [2019-10-15 01:27:49,233 INFO L600 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-10-15 01:27:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-15 01:27:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2019-10-15 01:27:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-10-15 01:27:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 487 transitions. [2019-10-15 01:27:49,248 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 487 transitions. Word has length 92 [2019-10-15 01:27:49,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:49,249 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 487 transitions. [2019-10-15 01:27:49,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:49,249 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 487 transitions. [2019-10-15 01:27:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-15 01:27:49,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:49,257 INFO L380 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, 1, 1, 1] [2019-10-15 01:27:49,257 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1585840345, now seen corresponding path program 1 times [2019-10-15 01:27:49,258 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:49,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620869899] [2019-10-15 01:27:49,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:27:49,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620869899] [2019-10-15 01:27:49,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:49,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:49,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280708851] [2019-10-15 01:27:49,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:49,353 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:49,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:49,354 INFO L87 Difference]: Start difference. First operand 290 states and 487 transitions. Second operand 5 states. [2019-10-15 01:27:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:49,518 INFO L93 Difference]: Finished difference Result 584 states and 985 transitions. [2019-10-15 01:27:49,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:49,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-15 01:27:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:49,521 INFO L225 Difference]: With dead ends: 584 [2019-10-15 01:27:49,521 INFO L226 Difference]: Without dead ends: 307 [2019-10-15 01:27:49,522 INFO L600 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-10-15 01:27:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-15 01:27:49,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-10-15 01:27:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-15 01:27:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 509 transitions. [2019-10-15 01:27:49,535 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 509 transitions. Word has length 92 [2019-10-15 01:27:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:49,535 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 509 transitions. [2019-10-15 01:27:49,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 509 transitions. [2019-10-15 01:27:49,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-15 01:27:49,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:49,537 INFO L380 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, 1, 1, 1] [2019-10-15 01:27:49,537 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:49,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:49,538 INFO L82 PathProgramCache]: Analyzing trace with hash 6376232, now seen corresponding path program 1 times [2019-10-15 01:27:49,538 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:49,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216614044] [2019-10-15 01:27:49,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,538 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:27:49,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216614044] [2019-10-15 01:27:49,587 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:49,587 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:49,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845728801] [2019-10-15 01:27:49,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:49,588 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:49,589 INFO L87 Difference]: Start difference. First operand 305 states and 509 transitions. Second operand 5 states. [2019-10-15 01:27:49,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:49,763 INFO L93 Difference]: Finished difference Result 599 states and 1003 transitions. [2019-10-15 01:27:49,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:49,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-10-15 01:27:49,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:49,765 INFO L225 Difference]: With dead ends: 599 [2019-10-15 01:27:49,765 INFO L226 Difference]: Without dead ends: 307 [2019-10-15 01:27:49,766 INFO L600 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-10-15 01:27:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-15 01:27:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-10-15 01:27:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-10-15 01:27:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 505 transitions. [2019-10-15 01:27:49,779 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 505 transitions. Word has length 93 [2019-10-15 01:27:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:49,779 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 505 transitions. [2019-10-15 01:27:49,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 505 transitions. [2019-10-15 01:27:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:27:49,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:49,781 INFO L380 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, 1, 1, 1, 1] [2019-10-15 01:27:49,781 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:49,782 INFO L82 PathProgramCache]: Analyzing trace with hash -854791455, now seen corresponding path program 1 times [2019-10-15 01:27:49,782 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:49,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238104356] [2019-10-15 01:27:49,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:49,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:49,826 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-15 01:27:49,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238104356] [2019-10-15 01:27:49,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:49,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:49,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301914669] [2019-10-15 01:27:49,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:49,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:49,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:49,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:49,828 INFO L87 Difference]: Start difference. First operand 305 states and 505 transitions. Second operand 5 states. [2019-10-15 01:27:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:49,991 INFO L93 Difference]: Finished difference Result 606 states and 1005 transitions. [2019-10-15 01:27:49,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:49,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:27:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:49,994 INFO L225 Difference]: With dead ends: 606 [2019-10-15 01:27:49,994 INFO L226 Difference]: Without dead ends: 314 [2019-10-15 01:27:49,995 INFO L600 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-10-15 01:27:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-15 01:27:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-10-15 01:27:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-15 01:27:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 511 transitions. [2019-10-15 01:27:50,013 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 511 transitions. Word has length 106 [2019-10-15 01:27:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:50,013 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 511 transitions. [2019-10-15 01:27:50,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 511 transitions. [2019-10-15 01:27:50,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 01:27:50,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:50,015 INFO L380 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, 1, 1, 1] [2019-10-15 01:27:50,016 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:50,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:50,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1777100668, now seen corresponding path program 1 times [2019-10-15 01:27:50,016 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:50,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274824875] [2019-10-15 01:27:50,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:27:50,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274824875] [2019-10-15 01:27:50,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:50,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:50,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210288860] [2019-10-15 01:27:50,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:50,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:50,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:50,083 INFO L87 Difference]: Start difference. First operand 314 states and 511 transitions. Second operand 5 states. [2019-10-15 01:27:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:50,295 INFO L93 Difference]: Finished difference Result 646 states and 1058 transitions. [2019-10-15 01:27:50,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:50,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-15 01:27:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:50,299 INFO L225 Difference]: With dead ends: 646 [2019-10-15 01:27:50,299 INFO L226 Difference]: Without dead ends: 345 [2019-10-15 01:27:50,300 INFO L600 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-10-15 01:27:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-15 01:27:50,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-10-15 01:27:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-15 01:27:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 558 transitions. [2019-10-15 01:27:50,329 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 558 transitions. Word has length 106 [2019-10-15 01:27:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:50,330 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 558 transitions. [2019-10-15 01:27:50,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 558 transitions. [2019-10-15 01:27:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:27:50,333 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:50,333 INFO L380 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, 1, 1, 1] [2019-10-15 01:27:50,334 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1284309403, now seen corresponding path program 1 times [2019-10-15 01:27:50,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:50,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876607632] [2019-10-15 01:27:50,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:27:50,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876607632] [2019-10-15 01:27:50,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:50,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:50,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093009629] [2019-10-15 01:27:50,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:50,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:50,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:50,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:50,398 INFO L87 Difference]: Start difference. First operand 343 states and 558 transitions. Second operand 5 states. [2019-10-15 01:27:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:50,590 INFO L93 Difference]: Finished difference Result 675 states and 1101 transitions. [2019-10-15 01:27:50,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:50,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-15 01:27:50,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:50,593 INFO L225 Difference]: With dead ends: 675 [2019-10-15 01:27:50,593 INFO L226 Difference]: Without dead ends: 345 [2019-10-15 01:27:50,594 INFO L600 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-10-15 01:27:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-15 01:27:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2019-10-15 01:27:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-15 01:27:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 554 transitions. [2019-10-15 01:27:50,609 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 554 transitions. Word has length 107 [2019-10-15 01:27:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:50,610 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 554 transitions. [2019-10-15 01:27:50,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 554 transitions. [2019-10-15 01:27:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 01:27:50,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:50,612 INFO L380 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, 1, 1, 1] [2019-10-15 01:27:50,612 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:50,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:50,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1845761004, now seen corresponding path program 1 times [2019-10-15 01:27:50,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:50,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118785351] [2019-10-15 01:27:50,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:27:50,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118785351] [2019-10-15 01:27:50,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:50,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:50,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736379276] [2019-10-15 01:27:50,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:50,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:50,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:50,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:50,672 INFO L87 Difference]: Start difference. First operand 343 states and 554 transitions. Second operand 5 states. [2019-10-15 01:27:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:50,859 INFO L93 Difference]: Finished difference Result 708 states and 1151 transitions. [2019-10-15 01:27:50,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:50,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-10-15 01:27:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:50,862 INFO L225 Difference]: With dead ends: 708 [2019-10-15 01:27:50,862 INFO L226 Difference]: Without dead ends: 378 [2019-10-15 01:27:50,863 INFO L600 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-10-15 01:27:50,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-15 01:27:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-10-15 01:27:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-15 01:27:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 596 transitions. [2019-10-15 01:27:50,879 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 596 transitions. Word has length 108 [2019-10-15 01:27:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:50,879 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 596 transitions. [2019-10-15 01:27:50,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 596 transitions. [2019-10-15 01:27:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-15 01:27:50,881 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:50,881 INFO L380 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, 1, 1, 1] [2019-10-15 01:27:50,882 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:50,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2036530603, now seen corresponding path program 1 times [2019-10-15 01:27:50,882 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:50,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455825348] [2019-10-15 01:27:50,882 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:50,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:50,947 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:27:50,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455825348] [2019-10-15 01:27:50,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:50,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:50,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639222961] [2019-10-15 01:27:50,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:50,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:50,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:50,950 INFO L87 Difference]: Start difference. First operand 370 states and 596 transitions. Second operand 5 states. [2019-10-15 01:27:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:51,137 INFO L93 Difference]: Finished difference Result 735 states and 1188 transitions. [2019-10-15 01:27:51,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:51,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-15 01:27:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:51,141 INFO L225 Difference]: With dead ends: 735 [2019-10-15 01:27:51,141 INFO L226 Difference]: Without dead ends: 378 [2019-10-15 01:27:51,142 INFO L600 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-10-15 01:27:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-15 01:27:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2019-10-15 01:27:51,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-10-15 01:27:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 591 transitions. [2019-10-15 01:27:51,158 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 591 transitions. Word has length 109 [2019-10-15 01:27:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:51,158 INFO L462 AbstractCegarLoop]: Abstraction has 370 states and 591 transitions. [2019-10-15 01:27:51,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 591 transitions. [2019-10-15 01:27:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:27:51,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:51,160 INFO L380 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, 1, 1] [2019-10-15 01:27:51,161 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:51,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:51,161 INFO L82 PathProgramCache]: Analyzing trace with hash -346552109, now seen corresponding path program 1 times [2019-10-15 01:27:51,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:51,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015471619] [2019-10-15 01:27:51,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:51,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:51,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:27:51,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015471619] [2019-10-15 01:27:51,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:51,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:51,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580040563] [2019-10-15 01:27:51,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:51,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:51,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:51,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:51,221 INFO L87 Difference]: Start difference. First operand 370 states and 591 transitions. Second operand 5 states. [2019-10-15 01:27:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:51,402 INFO L93 Difference]: Finished difference Result 752 states and 1206 transitions. [2019-10-15 01:27:51,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:51,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-15 01:27:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:51,405 INFO L225 Difference]: With dead ends: 752 [2019-10-15 01:27:51,405 INFO L226 Difference]: Without dead ends: 395 [2019-10-15 01:27:51,406 INFO L600 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-10-15 01:27:51,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-15 01:27:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-10-15 01:27:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-10-15 01:27:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 620 transitions. [2019-10-15 01:27:51,422 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 620 transitions. Word has length 112 [2019-10-15 01:27:51,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:51,422 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 620 transitions. [2019-10-15 01:27:51,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 620 transitions. [2019-10-15 01:27:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:27:51,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:51,424 INFO L380 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, 1, 1] [2019-10-15 01:27:51,424 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:51,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:51,425 INFO L82 PathProgramCache]: Analyzing trace with hash 768287860, now seen corresponding path program 1 times [2019-10-15 01:27:51,425 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:51,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976848659] [2019-10-15 01:27:51,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:51,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:51,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:27:51,477 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976848659] [2019-10-15 01:27:51,477 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:51,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:51,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890583806] [2019-10-15 01:27:51,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:51,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:51,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:51,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:51,479 INFO L87 Difference]: Start difference. First operand 391 states and 620 transitions. Second operand 5 states. [2019-10-15 01:27:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:51,668 INFO L93 Difference]: Finished difference Result 773 states and 1229 transitions. [2019-10-15 01:27:51,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:51,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-10-15 01:27:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:51,670 INFO L225 Difference]: With dead ends: 773 [2019-10-15 01:27:51,682 INFO L226 Difference]: Without dead ends: 395 [2019-10-15 01:27:51,684 INFO L600 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-10-15 01:27:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-15 01:27:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 391. [2019-10-15 01:27:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-10-15 01:27:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 614 transitions. [2019-10-15 01:27:51,701 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 614 transitions. Word has length 113 [2019-10-15 01:27:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:51,701 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 614 transitions. [2019-10-15 01:27:51,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 614 transitions. [2019-10-15 01:27:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:27:51,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:51,703 INFO L380 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, 1] [2019-10-15 01:27:51,703 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash -105487368, now seen corresponding path program 1 times [2019-10-15 01:27:51,704 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:51,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63385460] [2019-10-15 01:27:51,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:51,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:51,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:27:51,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63385460] [2019-10-15 01:27:51,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:51,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:51,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322460747] [2019-10-15 01:27:51,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:51,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:51,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:51,753 INFO L87 Difference]: Start difference. First operand 391 states and 614 transitions. Second operand 3 states. [2019-10-15 01:27:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:51,803 INFO L93 Difference]: Finished difference Result 1144 states and 1806 transitions. [2019-10-15 01:27:51,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:51,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-15 01:27:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:51,807 INFO L225 Difference]: With dead ends: 1144 [2019-10-15 01:27:51,807 INFO L226 Difference]: Without dead ends: 766 [2019-10-15 01:27:51,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-10-15 01:27:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2019-10-15 01:27:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-10-15 01:27:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1207 transitions. [2019-10-15 01:27:51,841 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1207 transitions. Word has length 128 [2019-10-15 01:27:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:51,841 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1207 transitions. [2019-10-15 01:27:51,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1207 transitions. [2019-10-15 01:27:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-15 01:27:51,843 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:51,844 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:27:51,844 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:51,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1228256447, now seen corresponding path program 1 times [2019-10-15 01:27:51,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:51,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802123495] [2019-10-15 01:27:51,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:51,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:51,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:27:51,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802123495] [2019-10-15 01:27:51,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:51,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:51,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478722523] [2019-10-15 01:27:51,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:51,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:51,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:51,911 INFO L87 Difference]: Start difference. First operand 766 states and 1207 transitions. Second operand 5 states. [2019-10-15 01:27:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:52,152 INFO L93 Difference]: Finished difference Result 1603 states and 2533 transitions. [2019-10-15 01:27:52,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:52,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-15 01:27:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:52,158 INFO L225 Difference]: With dead ends: 1603 [2019-10-15 01:27:52,158 INFO L226 Difference]: Without dead ends: 850 [2019-10-15 01:27:52,160 INFO L600 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-10-15 01:27:52,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-10-15 01:27:52,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 842. [2019-10-15 01:27:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-10-15 01:27:52,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1325 transitions. [2019-10-15 01:27:52,197 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1325 transitions. Word has length 129 [2019-10-15 01:27:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:52,197 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1325 transitions. [2019-10-15 01:27:52,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1325 transitions. [2019-10-15 01:27:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 01:27:52,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:52,200 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-15 01:27:52,200 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:52,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash 998366491, now seen corresponding path program 1 times [2019-10-15 01:27:52,201 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:52,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630071772] [2019-10-15 01:27:52,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:52,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:52,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:27:52,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630071772] [2019-10-15 01:27:52,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:52,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:52,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79932087] [2019-10-15 01:27:52,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:52,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:52,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:52,274 INFO L87 Difference]: Start difference. First operand 842 states and 1325 transitions. Second operand 5 states. [2019-10-15 01:27:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:52,497 INFO L93 Difference]: Finished difference Result 1679 states and 2645 transitions. [2019-10-15 01:27:52,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:52,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-15 01:27:52,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:52,501 INFO L225 Difference]: With dead ends: 1679 [2019-10-15 01:27:52,502 INFO L226 Difference]: Without dead ends: 846 [2019-10-15 01:27:52,504 INFO L600 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-10-15 01:27:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-10-15 01:27:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 838. [2019-10-15 01:27:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-10-15 01:27:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1313 transitions. [2019-10-15 01:27:52,535 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1313 transitions. Word has length 130 [2019-10-15 01:27:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:52,535 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1313 transitions. [2019-10-15 01:27:52,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1313 transitions. [2019-10-15 01:27:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-15 01:27:52,538 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:52,538 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:52,539 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1190868920, now seen corresponding path program 1 times [2019-10-15 01:27:52,539 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:52,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586433690] [2019-10-15 01:27:52,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:52,540 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:52,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-15 01:27:52,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586433690] [2019-10-15 01:27:52,600 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:52,600 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:52,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621105578] [2019-10-15 01:27:52,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:52,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:52,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:52,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:52,602 INFO L87 Difference]: Start difference. First operand 838 states and 1313 transitions. Second operand 5 states. [2019-10-15 01:27:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:52,904 INFO L93 Difference]: Finished difference Result 1739 states and 2729 transitions. [2019-10-15 01:27:52,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:52,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-10-15 01:27:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:52,912 INFO L225 Difference]: With dead ends: 1739 [2019-10-15 01:27:52,912 INFO L226 Difference]: Without dead ends: 914 [2019-10-15 01:27:52,915 INFO L600 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-10-15 01:27:52,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-10-15 01:27:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 910. [2019-10-15 01:27:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-10-15 01:27:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1421 transitions. [2019-10-15 01:27:52,972 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1421 transitions. Word has length 162 [2019-10-15 01:27:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:52,973 INFO L462 AbstractCegarLoop]: Abstraction has 910 states and 1421 transitions. [2019-10-15 01:27:52,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1421 transitions. [2019-10-15 01:27:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-15 01:27:52,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:52,980 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:52,980 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:52,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash -618678002, now seen corresponding path program 1 times [2019-10-15 01:27:52,981 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:52,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514284588] [2019-10-15 01:27:52,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:52,982 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:52,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-15 01:27:53,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514284588] [2019-10-15 01:27:53,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:53,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:53,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079795811] [2019-10-15 01:27:53,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:53,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:53,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:53,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:53,108 INFO L87 Difference]: Start difference. First operand 910 states and 1421 transitions. Second operand 5 states. [2019-10-15 01:27:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:53,334 INFO L93 Difference]: Finished difference Result 1811 states and 2829 transitions. [2019-10-15 01:27:53,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:53,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-10-15 01:27:53,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:53,339 INFO L225 Difference]: With dead ends: 1811 [2019-10-15 01:27:53,339 INFO L226 Difference]: Without dead ends: 910 [2019-10-15 01:27:53,341 INFO L600 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-10-15 01:27:53,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-10-15 01:27:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 906. [2019-10-15 01:27:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-10-15 01:27:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1407 transitions. [2019-10-15 01:27:53,377 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1407 transitions. Word has length 163 [2019-10-15 01:27:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:53,377 INFO L462 AbstractCegarLoop]: Abstraction has 906 states and 1407 transitions. [2019-10-15 01:27:53,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1407 transitions. [2019-10-15 01:27:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-15 01:27:53,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:53,381 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:53,381 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:53,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1613187866, now seen corresponding path program 1 times [2019-10-15 01:27:53,382 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:53,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204393429] [2019-10-15 01:27:53,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:53,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:53,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-15 01:27:53,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204393429] [2019-10-15 01:27:53,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:53,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:53,448 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27630053] [2019-10-15 01:27:53,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:53,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:53,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:53,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:53,450 INFO L87 Difference]: Start difference. First operand 906 states and 1407 transitions. Second operand 5 states. [2019-10-15 01:27:53,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:53,719 INFO L93 Difference]: Finished difference Result 1871 states and 2909 transitions. [2019-10-15 01:27:53,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:53,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-10-15 01:27:53,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:53,727 INFO L225 Difference]: With dead ends: 1871 [2019-10-15 01:27:53,727 INFO L226 Difference]: Without dead ends: 978 [2019-10-15 01:27:53,730 INFO L600 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-10-15 01:27:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-10-15 01:27:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-10-15 01:27:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-10-15 01:27:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1505 transitions. [2019-10-15 01:27:53,800 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1505 transitions. Word has length 193 [2019-10-15 01:27:53,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:53,801 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1505 transitions. [2019-10-15 01:27:53,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1505 transitions. [2019-10-15 01:27:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-15 01:27:53,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:53,807 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:53,807 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:53,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1368180736, now seen corresponding path program 1 times [2019-10-15 01:27:53,808 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:53,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931365785] [2019-10-15 01:27:53,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:53,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:53,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-15 01:27:53,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931365785] [2019-10-15 01:27:53,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:53,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:53,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249035244] [2019-10-15 01:27:53,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:53,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:53,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:53,903 INFO L87 Difference]: Start difference. First operand 974 states and 1505 transitions. Second operand 5 states. [2019-10-15 01:27:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:54,122 INFO L93 Difference]: Finished difference Result 1939 states and 2997 transitions. [2019-10-15 01:27:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:54,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 194 [2019-10-15 01:27:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:54,127 INFO L225 Difference]: With dead ends: 1939 [2019-10-15 01:27:54,127 INFO L226 Difference]: Without dead ends: 974 [2019-10-15 01:27:54,129 INFO L600 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-10-15 01:27:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-10-15 01:27:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 970. [2019-10-15 01:27:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-10-15 01:27:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1489 transitions. [2019-10-15 01:27:54,171 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1489 transitions. Word has length 194 [2019-10-15 01:27:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:54,172 INFO L462 AbstractCegarLoop]: Abstraction has 970 states and 1489 transitions. [2019-10-15 01:27:54,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1489 transitions. [2019-10-15 01:27:54,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-15 01:27:54,178 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:54,178 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:54,178 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1741358840, now seen corresponding path program 1 times [2019-10-15 01:27:54,179 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:54,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711998632] [2019-10-15 01:27:54,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:54,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:54,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:54,273 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-15 01:27:54,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711998632] [2019-10-15 01:27:54,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:54,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:54,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932783335] [2019-10-15 01:27:54,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:54,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:54,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:54,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:54,277 INFO L87 Difference]: Start difference. First operand 970 states and 1489 transitions. Second operand 5 states. [2019-10-15 01:27:54,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:54,590 INFO L93 Difference]: Finished difference Result 2003 states and 3085 transitions. [2019-10-15 01:27:54,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:54,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-10-15 01:27:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:54,598 INFO L225 Difference]: With dead ends: 2003 [2019-10-15 01:27:54,598 INFO L226 Difference]: Without dead ends: 1046 [2019-10-15 01:27:54,603 INFO L600 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-10-15 01:27:54,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-10-15 01:27:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-10-15 01:27:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-15 01:27:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1553 transitions. [2019-10-15 01:27:54,693 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1553 transitions. Word has length 212 [2019-10-15 01:27:54,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:54,694 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1553 transitions. [2019-10-15 01:27:54,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1553 transitions. [2019-10-15 01:27:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-15 01:27:54,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:54,700 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:54,700 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:54,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1179693335, now seen corresponding path program 1 times [2019-10-15 01:27:54,701 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:54,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319470765] [2019-10-15 01:27:54,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:54,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:54,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-15 01:27:54,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319470765] [2019-10-15 01:27:54,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:54,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:54,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057317560] [2019-10-15 01:27:54,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:54,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:54,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:54,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:54,822 INFO L87 Difference]: Start difference. First operand 1020 states and 1553 transitions. Second operand 5 states. [2019-10-15 01:27:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:55,120 INFO L93 Difference]: Finished difference Result 2053 states and 3131 transitions. [2019-10-15 01:27:55,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:55,121 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-10-15 01:27:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:55,128 INFO L225 Difference]: With dead ends: 2053 [2019-10-15 01:27:55,128 INFO L226 Difference]: Without dead ends: 1046 [2019-10-15 01:27:55,131 INFO L600 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-10-15 01:27:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-10-15 01:27:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1020. [2019-10-15 01:27:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-15 01:27:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1535 transitions. [2019-10-15 01:27:55,192 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1535 transitions. Word has length 213 [2019-10-15 01:27:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:55,193 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1535 transitions. [2019-10-15 01:27:55,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1535 transitions. [2019-10-15 01:27:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-15 01:27:55,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:55,201 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:55,201 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2078256648, now seen corresponding path program 1 times [2019-10-15 01:27:55,202 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:55,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27394939] [2019-10-15 01:27:55,202 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,203 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-15 01:27:55,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27394939] [2019-10-15 01:27:55,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:55,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:55,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456766977] [2019-10-15 01:27:55,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:55,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:55,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:55,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:55,328 INFO L87 Difference]: Start difference. First operand 1020 states and 1535 transitions. Second operand 5 states. [2019-10-15 01:27:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:55,667 INFO L93 Difference]: Finished difference Result 2035 states and 3063 transitions. [2019-10-15 01:27:55,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:55,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 224 [2019-10-15 01:27:55,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:55,673 INFO L225 Difference]: With dead ends: 2035 [2019-10-15 01:27:55,673 INFO L226 Difference]: Without dead ends: 1028 [2019-10-15 01:27:55,677 INFO L600 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-10-15 01:27:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2019-10-15 01:27:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1020. [2019-10-15 01:27:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-15 01:27:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1523 transitions. [2019-10-15 01:27:55,720 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1523 transitions. Word has length 224 [2019-10-15 01:27:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:55,721 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1523 transitions. [2019-10-15 01:27:55,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:55,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1523 transitions. [2019-10-15 01:27:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-15 01:27:55,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:55,725 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:55,725 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash -836415730, now seen corresponding path program 1 times [2019-10-15 01:27:55,725 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:55,726 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630007496] [2019-10-15 01:27:55,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:55,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-15 01:27:55,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630007496] [2019-10-15 01:27:55,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:55,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:55,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135703006] [2019-10-15 01:27:55,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:55,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:55,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:55,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:55,805 INFO L87 Difference]: Start difference. First operand 1020 states and 1523 transitions. Second operand 5 states. [2019-10-15 01:27:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,043 INFO L93 Difference]: Finished difference Result 2035 states and 3039 transitions. [2019-10-15 01:27:56,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:56,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-10-15 01:27:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,051 INFO L225 Difference]: With dead ends: 2035 [2019-10-15 01:27:56,051 INFO L226 Difference]: Without dead ends: 1010 [2019-10-15 01:27:56,054 INFO L600 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-10-15 01:27:56,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2019-10-15 01:27:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1002. [2019-10-15 01:27:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-10-15 01:27:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1485 transitions. [2019-10-15 01:27:56,110 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1485 transitions. Word has length 225 [2019-10-15 01:27:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,111 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1485 transitions. [2019-10-15 01:27:56,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1485 transitions. [2019-10-15 01:27:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-15 01:27:56,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,119 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:56,120 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1494389851, now seen corresponding path program 1 times [2019-10-15 01:27:56,121 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340513592] [2019-10-15 01:27:56,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-15 01:27:56,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340513592] [2019-10-15 01:27:56,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:56,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037692812] [2019-10-15 01:27:56,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:56,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:56,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:56,236 INFO L87 Difference]: Start difference. First operand 1002 states and 1485 transitions. Second operand 5 states. [2019-10-15 01:27:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,486 INFO L93 Difference]: Finished difference Result 2045 states and 3037 transitions. [2019-10-15 01:27:56,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:56,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 233 [2019-10-15 01:27:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,492 INFO L225 Difference]: With dead ends: 2045 [2019-10-15 01:27:56,492 INFO L226 Difference]: Without dead ends: 1056 [2019-10-15 01:27:56,494 INFO L600 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-10-15 01:27:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-10-15 01:27:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1048. [2019-10-15 01:27:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-15 01:27:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1539 transitions. [2019-10-15 01:27:56,538 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1539 transitions. Word has length 233 [2019-10-15 01:27:56,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,538 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1539 transitions. [2019-10-15 01:27:56,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1539 transitions. [2019-10-15 01:27:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-15 01:27:56,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,543 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:56,543 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1829546886, now seen corresponding path program 1 times [2019-10-15 01:27:56,544 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638023926] [2019-10-15 01:27:56,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,544 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-15 01:27:56,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638023926] [2019-10-15 01:27:56,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:56,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:27:56,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581509280] [2019-10-15 01:27:56,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:27:56,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:56,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:27:56,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:56,619 INFO L87 Difference]: Start difference. First operand 1048 states and 1539 transitions. Second operand 5 states. [2019-10-15 01:27:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:56,821 INFO L93 Difference]: Finished difference Result 2091 states and 3071 transitions. [2019-10-15 01:27:56,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:27:56,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-10-15 01:27:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:56,827 INFO L225 Difference]: With dead ends: 2091 [2019-10-15 01:27:56,827 INFO L226 Difference]: Without dead ends: 1048 [2019-10-15 01:27:56,829 INFO L600 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-10-15 01:27:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-10-15 01:27:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1040. [2019-10-15 01:27:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-10-15 01:27:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1507 transitions. [2019-10-15 01:27:56,872 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1507 transitions. Word has length 234 [2019-10-15 01:27:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:56,872 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1507 transitions. [2019-10-15 01:27:56,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:27:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1507 transitions. [2019-10-15 01:27:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-15 01:27:56,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:56,876 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:56,877 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:56,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash 678328095, now seen corresponding path program 1 times [2019-10-15 01:27:56,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:56,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539200559] [2019-10-15 01:27:56,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:56,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-15 01:27:57,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539200559] [2019-10-15 01:27:57,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391852716] [2019-10-15 01:27:57,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:27:57,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-15 01:27:57,279 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-15 01:27:57,369 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:57,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:27:57,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339490182] [2019-10-15 01:27:57,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:57,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:57,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:57,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:57,371 INFO L87 Difference]: Start difference. First operand 1040 states and 1507 transitions. Second operand 3 states. [2019-10-15 01:27:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:57,481 INFO L93 Difference]: Finished difference Result 2579 states and 3740 transitions. [2019-10-15 01:27:57,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:57,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-10-15 01:27:57,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:57,490 INFO L225 Difference]: With dead ends: 2579 [2019-10-15 01:27:57,490 INFO L226 Difference]: Without dead ends: 1552 [2019-10-15 01:27:57,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 539 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-10-15 01:27:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2019-10-15 01:27:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2019-10-15 01:27:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1552 states. [2019-10-15 01:27:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 2249 transitions. [2019-10-15 01:27:57,598 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 2249 transitions. Word has length 270 [2019-10-15 01:27:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:57,599 INFO L462 AbstractCegarLoop]: Abstraction has 1552 states and 2249 transitions. [2019-10-15 01:27:57,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 2249 transitions. [2019-10-15 01:27:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-15 01:27:57,605 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:57,605 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:57,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:57,813 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:57,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash -230386138, now seen corresponding path program 1 times [2019-10-15 01:27:57,814 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:57,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775250879] [2019-10-15 01:27:57,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:57,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-15 01:27:57,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775250879] [2019-10-15 01:27:57,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:57,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:57,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145636128] [2019-10-15 01:27:57,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:57,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:57,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:57,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:57,998 INFO L87 Difference]: Start difference. First operand 1552 states and 2249 transitions. Second operand 3 states. [2019-10-15 01:27:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:58,141 INFO L93 Difference]: Finished difference Result 4547 states and 6592 transitions. [2019-10-15 01:27:58,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:58,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-10-15 01:27:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:58,155 INFO L225 Difference]: With dead ends: 4547 [2019-10-15 01:27:58,156 INFO L226 Difference]: Without dead ends: 3008 [2019-10-15 01:27:58,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-10-15 01:27:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3007. [2019-10-15 01:27:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3007 states. [2019-10-15 01:27:58,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4350 transitions. [2019-10-15 01:27:58,311 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4350 transitions. Word has length 278 [2019-10-15 01:27:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:58,312 INFO L462 AbstractCegarLoop]: Abstraction has 3007 states and 4350 transitions. [2019-10-15 01:27:58,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4350 transitions. [2019-10-15 01:27:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-10-15 01:27:58,317 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:58,317 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 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, 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-10-15 01:27:58,318 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash -860287162, now seen corresponding path program 1 times [2019-10-15 01:27:58,319 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:58,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350568930] [2019-10-15 01:27:58,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 536 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-15 01:27:58,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350568930] [2019-10-15 01:27:58,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:27:58,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:27:58,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834043229] [2019-10-15 01:27:58,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:58,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:58,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:58,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:58,472 INFO L87 Difference]: Start difference. First operand 3007 states and 4350 transitions. Second operand 3 states. [2019-10-15 01:27:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:58,823 INFO L93 Difference]: Finished difference Result 6121 states and 8875 transitions. [2019-10-15 01:27:58,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:58,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-10-15 01:27:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:58,835 INFO L225 Difference]: With dead ends: 6121 [2019-10-15 01:27:58,836 INFO L226 Difference]: Without dead ends: 2006 [2019-10-15 01:27:58,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:27:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-10-15 01:27:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1986. [2019-10-15 01:27:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2019-10-15 01:27:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2824 transitions. [2019-10-15 01:27:58,949 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2824 transitions. Word has length 315 [2019-10-15 01:27:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:58,949 INFO L462 AbstractCegarLoop]: Abstraction has 1986 states and 2824 transitions. [2019-10-15 01:27:58,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2824 transitions. [2019-10-15 01:27:58,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-10-15 01:27:58,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:58,954 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:27:58,955 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:27:58,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:27:58,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2044603392, now seen corresponding path program 1 times [2019-10-15 01:27:58,955 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:27:58,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963816720] [2019-10-15 01:27:58,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:27:58,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:27:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-10-15 01:27:59,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963816720] [2019-10-15 01:27:59,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655272049] [2019-10-15 01:27:59,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:27:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:27:59,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:27:59,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:27:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-10-15 01:27:59,481 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:27:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1398 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2019-10-15 01:27:59,572 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:27:59,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:27:59,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694650897] [2019-10-15 01:27:59,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:27:59,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:27:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:27:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:59,578 INFO L87 Difference]: Start difference. First operand 1986 states and 2824 transitions. Second operand 3 states. [2019-10-15 01:27:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:27:59,694 INFO L93 Difference]: Finished difference Result 4612 states and 6551 transitions. [2019-10-15 01:27:59,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:27:59,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 382 [2019-10-15 01:27:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:27:59,720 INFO L225 Difference]: With dead ends: 4612 [2019-10-15 01:27:59,720 INFO L226 Difference]: Without dead ends: 2639 [2019-10-15 01:27:59,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:27:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2019-10-15 01:27:59,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2639. [2019-10-15 01:27:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-10-15 01:27:59,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3738 transitions. [2019-10-15 01:27:59,853 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3738 transitions. Word has length 382 [2019-10-15 01:27:59,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:27:59,854 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 3738 transitions. [2019-10-15 01:27:59,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:27:59,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3738 transitions. [2019-10-15 01:27:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-15 01:27:59,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:27:59,861 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:00,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:00,066 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:00,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:00,066 INFO L82 PathProgramCache]: Analyzing trace with hash 134700959, now seen corresponding path program 1 times [2019-10-15 01:28:00,066 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:00,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823708357] [2019-10-15 01:28:00,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:00,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-15 01:28:00,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823708357] [2019-10-15 01:28:00,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437958662] [2019-10-15 01:28:00,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:00,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:00,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:00,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-10-15 01:28:00,748 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2019-10-15 01:28:00,922 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:28:00,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-15 01:28:00,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966707106] [2019-10-15 01:28:00,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:00,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:00,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:00,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:00,925 INFO L87 Difference]: Start difference. First operand 2639 states and 3738 transitions. Second operand 3 states. [2019-10-15 01:28:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:00,998 INFO L93 Difference]: Finished difference Result 2700 states and 3825 transitions. [2019-10-15 01:28:00,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:00,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 453 [2019-10-15 01:28:01,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:01,006 INFO L225 Difference]: With dead ends: 2700 [2019-10-15 01:28:01,007 INFO L226 Difference]: Without dead ends: 2106 [2019-10-15 01:28:01,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-10-15 01:28:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2048. [2019-10-15 01:28:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-10-15 01:28:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2908 transitions. [2019-10-15 01:28:01,108 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2908 transitions. Word has length 453 [2019-10-15 01:28:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:01,109 INFO L462 AbstractCegarLoop]: Abstraction has 2048 states and 2908 transitions. [2019-10-15 01:28:01,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2908 transitions. [2019-10-15 01:28:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-10-15 01:28:01,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:01,115 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:01,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:01,319 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1776341599, now seen corresponding path program 1 times [2019-10-15 01:28:01,319 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:01,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622043635] [2019-10-15 01:28:01,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:01,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:01,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-15 01:28:01,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622043635] [2019-10-15 01:28:01,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080809856] [2019-10-15 01:28:01,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:01,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:01,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-15 01:28:01,836 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2022 backedges. 1196 proven. 26 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-15 01:28:02,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1228702462] [2019-10-15 01:28:02,020 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 454 [2019-10-15 01:28:02,068 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:02,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:02,361 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:03,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:03,798 INFO L272 AbstractInterpreter]: Visited 103 different actions 2161 times. Merged at 88 different actions 1789 times. Widened at 19 different actions 265 times. Performed 5181 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5181 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 245 fixpoints after 28 different actions. Largest state had 95 variables. [2019-10-15 01:28:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:03,804 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:03,804 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:03,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:03,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978519611] [2019-10-15 01:28:03,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:03,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:03,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:03,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:03,806 INFO L87 Difference]: Start difference. First operand 2048 states and 2908 transitions. Second operand 6 states. [2019-10-15 01:28:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:04,294 INFO L93 Difference]: Finished difference Result 4236 states and 6005 transitions. [2019-10-15 01:28:04,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:04,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 453 [2019-10-15 01:28:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:04,306 INFO L225 Difference]: With dead ends: 4236 [2019-10-15 01:28:04,306 INFO L226 Difference]: Without dead ends: 2157 [2019-10-15 01:28:04,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 907 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:28:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2019-10-15 01:28:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1910. [2019-10-15 01:28:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-10-15 01:28:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2585 transitions. [2019-10-15 01:28:04,388 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2585 transitions. Word has length 453 [2019-10-15 01:28:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:04,389 INFO L462 AbstractCegarLoop]: Abstraction has 1910 states and 2585 transitions. [2019-10-15 01:28:04,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2585 transitions. [2019-10-15 01:28:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2019-10-15 01:28:04,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:04,399 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:04,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:04,614 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:04,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1812552048, now seen corresponding path program 1 times [2019-10-15 01:28:04,615 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:04,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697211203] [2019-10-15 01:28:04,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,616 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:04,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-10-15 01:28:05,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697211203] [2019-10-15 01:28:05,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051840965] [2019-10-15 01:28:05,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:05,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:28:05,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:28:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-10-15 01:28:05,598 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:28:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8111 backedges. 4746 proven. 26 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2019-10-15 01:28:05,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1296992556] [2019-10-15 01:28:05,903 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 855 [2019-10-15 01:28:05,913 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:28:05,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:28:05,968 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-15 01:28:07,165 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:28:07,166 INFO L272 AbstractInterpreter]: Visited 115 different actions 2356 times. Merged at 96 different actions 1896 times. Widened at 22 different actions 290 times. Performed 5861 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5861 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 296 fixpoints after 23 different actions. Largest state had 99 variables. [2019-10-15 01:28:07,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:07,166 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:28:07,166 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:28:07,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-15 01:28:07,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010920394] [2019-10-15 01:28:07,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:07,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:07,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:07,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:07,169 INFO L87 Difference]: Start difference. First operand 1910 states and 2585 transitions. Second operand 6 states. [2019-10-15 01:28:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:07,698 INFO L93 Difference]: Finished difference Result 5655 states and 7784 transitions. [2019-10-15 01:28:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:07,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 854 [2019-10-15 01:28:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:07,707 INFO L225 Difference]: With dead ends: 5655 [2019-10-15 01:28:07,707 INFO L226 Difference]: Without dead ends: 3619 [2019-10-15 01:28:07,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1717 GetRequests, 1710 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3619 states. [2019-10-15 01:28:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3619 to 2170. [2019-10-15 01:28:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-15 01:28:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2977 transitions. [2019-10-15 01:28:07,811 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2977 transitions. Word has length 854 [2019-10-15 01:28:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:07,812 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2977 transitions. [2019-10-15 01:28:07,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2977 transitions. [2019-10-15 01:28:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2019-10-15 01:28:07,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:07,831 INFO L380 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:08,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:28:08,038 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1607522492, now seen corresponding path program 1 times [2019-10-15 01:28:08,039 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:08,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386345211] [2019-10-15 01:28:08,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:08,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12523 backedges. 5859 proven. 0 refuted. 0 times theorem prover too weak. 6664 trivial. 0 not checked. [2019-10-15 01:28:08,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386345211] [2019-10-15 01:28:08,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:08,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:08,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140883193] [2019-10-15 01:28:08,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:08,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:08,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:08,732 INFO L87 Difference]: Start difference. First operand 2170 states and 2977 transitions. Second operand 3 states. [2019-10-15 01:28:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:08,924 INFO L93 Difference]: Finished difference Result 4361 states and 5976 transitions. [2019-10-15 01:28:08,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:08,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1035 [2019-10-15 01:28:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:08,929 INFO L225 Difference]: With dead ends: 4361 [2019-10-15 01:28:08,929 INFO L226 Difference]: Without dead ends: 2210 [2019-10-15 01:28:08,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-10-15 01:28:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2170. [2019-10-15 01:28:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-15 01:28:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2957 transitions. [2019-10-15 01:28:09,015 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2957 transitions. Word has length 1035 [2019-10-15 01:28:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,016 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2957 transitions. [2019-10-15 01:28:09,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2957 transitions. [2019-10-15 01:28:09,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2019-10-15 01:28:09,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,029 INFO L380 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 32, 32, 32, 29, 29, 26, 26, 23, 23, 20, 20, 20, 20, 17, 14, 14, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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-10-15 01:28:09,030 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash 123556935, now seen corresponding path program 1 times [2019-10-15 01:28:09,031 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937812711] [2019-10-15 01:28:09,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 12731 backedges. 5768 proven. 0 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2019-10-15 01:28:09,596 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937812711] [2019-10-15 01:28:09,597 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:09,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:09,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419864302] [2019-10-15 01:28:09,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:09,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:09,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:09,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:09,598 INFO L87 Difference]: Start difference. First operand 2170 states and 2957 transitions. Second operand 3 states. [2019-10-15 01:28:09,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:09,764 INFO L93 Difference]: Finished difference Result 4342 states and 5914 transitions. [2019-10-15 01:28:09,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:09,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1050 [2019-10-15 01:28:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:09,768 INFO L225 Difference]: With dead ends: 4342 [2019-10-15 01:28:09,769 INFO L226 Difference]: Without dead ends: 2191 [2019-10-15 01:28:09,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2019-10-15 01:28:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2170. [2019-10-15 01:28:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-15 01:28:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2941 transitions. [2019-10-15 01:28:09,854 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2941 transitions. Word has length 1050 [2019-10-15 01:28:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:09,854 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2941 transitions. [2019-10-15 01:28:09,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2941 transitions. [2019-10-15 01:28:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2019-10-15 01:28:09,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:09,869 INFO L380 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:09,870 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:09,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:09,870 INFO L82 PathProgramCache]: Analyzing trace with hash 860689758, now seen corresponding path program 1 times [2019-10-15 01:28:09,870 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:09,871 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583997074] [2019-10-15 01:28:09,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,871 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:09,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 13413 backedges. 6481 proven. 0 refuted. 0 times theorem prover too weak. 6932 trivial. 0 not checked. [2019-10-15 01:28:10,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583997074] [2019-10-15 01:28:10,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:10,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:10,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332933040] [2019-10-15 01:28:10,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:10,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:10,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:10,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,415 INFO L87 Difference]: Start difference. First operand 2170 states and 2941 transitions. Second operand 3 states. [2019-10-15 01:28:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:10,581 INFO L93 Difference]: Finished difference Result 4395 states and 5959 transitions. [2019-10-15 01:28:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:10,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1078 [2019-10-15 01:28:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:10,586 INFO L225 Difference]: With dead ends: 4395 [2019-10-15 01:28:10,586 INFO L226 Difference]: Without dead ends: 2226 [2019-10-15 01:28:10,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2019-10-15 01:28:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2212. [2019-10-15 01:28:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2212 states. [2019-10-15 01:28:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 2977 transitions. [2019-10-15 01:28:10,679 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 2977 transitions. Word has length 1078 [2019-10-15 01:28:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:10,680 INFO L462 AbstractCegarLoop]: Abstraction has 2212 states and 2977 transitions. [2019-10-15 01:28:10,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 2977 transitions. [2019-10-15 01:28:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2019-10-15 01:28:10,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:10,698 INFO L380 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 36, 36, 36, 36, 36, 36, 33, 33, 33, 30, 30, 27, 27, 24, 24, 21, 21, 21, 21, 18, 15, 15, 12, 12, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-15 01:28:10,698 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ERRErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:10,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1775510994, now seen corresponding path program 1 times [2019-10-15 01:28:10,699 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:10,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356570794] [2019-10-15 01:28:10,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:10,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:11,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13929 backedges. 6521 proven. 0 refuted. 0 times theorem prover too weak. 7408 trivial. 0 not checked. [2019-10-15 01:28:11,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356570794] [2019-10-15 01:28:11,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:11,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:11,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876384026] [2019-10-15 01:28:11,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:11,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:11,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:11,498 INFO L87 Difference]: Start difference. First operand 2212 states and 2977 transitions. Second operand 3 states. [2019-10-15 01:28:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:11,636 INFO L93 Difference]: Finished difference Result 2846 states and 3818 transitions. [2019-10-15 01:28:11,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:11,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1110 [2019-10-15 01:28:11,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:11,637 INFO L225 Difference]: With dead ends: 2846 [2019-10-15 01:28:11,637 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:11,642 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:11,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:11,643 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1110 [2019-10-15 01:28:11,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:11,643 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:11,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:11,644 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:11,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:11,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:12,381 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 198 [2019-10-15 01:28:13,132 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 193 [2019-10-15 01:28:13,579 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 166 [2019-10-15 01:28:14,455 WARN L191 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 116 [2019-10-15 01:28:15,301 WARN L191 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 117